3341 search results - page 610 / 669 » On Bounded Queries and Approximation |
100
click to vote
VRST
2003
ACM
15 years 3 months ago
2003
ACM
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
AIPS
2010
15 years 3 days ago
2010
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
IWMM
2010
Springer
14 years 11 months ago
2010
Springer
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...