6315 search results - page 8 / 1263 » Approximating Solution Structure |
104
click to vote
AAAI
2000
14 years 11 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
ISIPTA
2005
IEEE
15 years 3 months ago
2005
IEEE
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
101
click to vote
AI
2011
Springer
14 years 4 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
121
click to vote
EDBT
2006
ACM
15 years 1 months ago
2006
ACM
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...