The recent uptake of non-acoustic underwater transmission systems suggests that in the
near future it will be common for underwater devices to incorporate different physical …

High-performance computer architecture (2nd ed.) | Guide books skip to main content ACM
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in …

In this paper we analyze the scalability of a number of load balancing algorithms which can
be applied to problems that have the following characteristics: the work done by a processor …

This book is about problem solving. Specifically, it is about heuristic state-space search
under branch-and-bound framework for solving com binatorial optimization problems. The …

Mobile edge caching/computing (MEC) has been emerging as a promising paradigm to
provide ultra-high rate, ultra-reliable, and/or low-latency communications in future wireless …

A general technique that can be used to solve a wide variety of discrete optimization
problems is the branch-and-bound algorithm. We have adapted and extended branch-and …

We give a partial overview of some results from the rich theory of branching processes and
illustrate their use in the probabilistic analysis of algorithms and data structures. The …

The traveling salesman problem (TSP) is one of the best-known combinatorial optimization
problems. Branch-and-bound (BnB) is the best method for finding an optimal solution of the …

Search algorithms that use space linear in the search depth are widely employed in practice
to solve difficult problems optimally, such as planning and scheduling. In this paper, we …

Discrete optimization problems (DOPs) arise in various applications such as planning,
scheduling, computer aided design, robotics, game playing and constraint directed …