1639 search results - page 46 / 328 » Anytime Heuristic Search |
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
ICLP
2010
Springer
14 years 1 months ago
2010
Springer
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
ISMIS
1999
Springer
14 years 1 months ago
1999
Springer
In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a hig...
ICTAI
2006
IEEE
14 years 3 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
AIPS
2010
13 years 12 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...