6315 search results - page 145 / 1263 » Approximating Solution Structure |
175
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
149
click to vote
DAM
2006
15 years 6 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
157
click to vote
IJAR
2006
15 years 6 months ago
2006
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...
177
click to vote
MOC
2002
15 years 6 months ago
2002
We consider a family of tensor product finite element methods for hyperbolic equations in RN , N 2, which are explicit and generate a continuous approximate solution. The base cas...
170
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...