539 search results - page 10 / 108 » An Improved Upper Bound for SAT |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
GLVLSI
2008
IEEE
13 years 8 months ago
2008
IEEE
The main contribution of this work is an analytical model for finding the upper bound on the temperature difference among various locations on the die. The proposed model can be u...
JGT
2007
13 years 7 months ago
2007
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
AAAI
2004
13 years 8 months ago
2004
Recently, several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithm. These lower bounds improve significantly the perf...