We present a way to integrate search and Monte-Carlo methods in the game of Go. Our program uses search to find the status of tactical goals, builds groups, selects interesting go...
Existing techniques for keyword/attribute search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unab...
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
In this paper we present VOCUS: a robust computational attention system for goal-directed search. A standard bottom-up architecture is extended by a top-down component, enabling th...
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...