1263 search results - page 135 / 253 » A* with Bounded Costs |
ICCAD
1997
IEEE
14 years 1 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
SIROCCO
2007
13 years 11 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
CN
2007
13 years 9 months ago
2007
— Today’s Internet carries an ever broadening range of application traffic with different requirements. This has stressed its original, one-class, best-effort model, and has b...
TKDE
2012
12 years 2 days ago
2012
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...