7006 search results - page 411 / 1402 » Approximation Algorithms |
172
click to vote
UAI
2008
15 years 6 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
143
click to vote
JACM
2000
15 years 4 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
145
click to vote
SIGMETRICS
2010
ACM
15 years 3 months ago
2010
ACM
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
187
click to vote
AI
2011
Springer
14 years 12 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
138
click to vote
OL
2007
15 years 4 months ago
2007
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...