673 search results - page 89 / 135 » Approximate coherence-based reasoning |
156
click to vote
CAV
2003
Springer
15 years 3 months ago
2003
Springer
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
209
click to vote
NLP
2000
15 years 3 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
AAAI
2000
15 years 1 months ago
2000
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given pl...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
142
click to vote
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
14 years 6 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...