1047 search results - page 68 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
PPDP
2001
Springer
14 years 8 days ago
2001
Springer
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
JAIR
2008
13 years 7 months ago
2008
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
ICCD
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— In this paper, we introduce a novel preimage computation technique that directly computes the circuit cofactors without an explicit search for any satisfiable solution...
AE
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We propose a new niching method for Evolutionary Algorithms which is able to identify and track global and local optima in a multimodal search space. To prevent the loss ...