3433 search results - page 216 / 687 » Heuristics for a bidding problem |
199
click to vote
JAIR
2006
15 years 6 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
153
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis depend...
189
click to vote
ISCC
2000
IEEE
15 years 11 months ago
2000
IEEE
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
196
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
153
click to vote
ICCAD
1996
IEEE
15 years 10 months ago
1996
IEEE
Many practical routing problems such as BGA, PGA, pin redistribution and test xture routing involve routing with interchangeable pins. These routing problems, especiallypackage la...