3433 search results - page 91 / 687 » Heuristics for a bidding problem |
AIPS
2007
14 years 13 days ago
2007
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
KI
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributimpact of operators that t...
ICTAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Given a nite state machine denoting the speci cation of a system, nding some short interaction sequences capable to reach some/all states or transitions of this machine...
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
GEOINFORMATICA
2002
13 years 10 months ago
2002
The generation of better label placement configurations in maps is a problem that comes up in automated cartographic production. The objective of a good label placement is to displ...