Designing efficient algorithms for parallel computers | Guide books skip to main content ACM
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign …

DIB is a general-purpose package that allows a wide range of applications such as
recursive backtrack, branch and bound, and alpha-beta search to be implemented on a …

The essential guide to solving algorithmic and networking problems in commercial computer
games, revised and extended Algorithms and Networking for Computer Games, Second …

Une personne ressent un probleme des qu'elle se trouve dans une situation ou elle désire
quelque chose alors qu'elle ne voit pas immédiatement la suite d'actionsa accomplir pour …

This book discusses a new model for implementing user applications on distributed systems.
The proposed model, called the shared data-object model, intends to ease distributed …

The design issues affecting a parallel implementation of the alpha-beta search algorithm are
discussed with emphasis on a tree decomposition scheme that is intended for use on well …

This paper discusses two general schemes for performing branch-and-bound (B&B) search
in parallel. These schemes are applicable in principle to most of the problems which can be …

The concepts of artificial intelligence have been applied for the development of a software
system for metabolic pathway synthesis (MPS). An easily expandable data base system for …

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

This chapter presents three paradigms of representations for combinatorial search
problems. Depending on the functions of the nonterminal nodes in the graphical …