944 search results - page 14 / 189 » Heuristic Search for Large Problems With Real Costs |
ADHOC
2007
14 years 10 months ago
2007
— In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In o...
ICDCS
1999
IEEE
15 years 2 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
CP
1999
Springer
15 years 2 months ago
1999
Springer
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
JAIR
2006
14 years 9 months ago
2006
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
AAAI
2004
14 years 11 months ago
2004
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a sub...