15073 search results - page 2761 / 3015 » Probabilistic algorithms for computing resultants |
134
click to vote
CPAIOR
2010
Springer
15 years 7 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
132
Voted
AAAI
2007
15 years 6 months ago
2007
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
129
click to vote
AAAI
2007
15 years 6 months ago
2007
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...
113
Voted
AAAI
2007
15 years 6 months ago
2007
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
145
click to vote
FLAIRS
2008
15 years 6 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...