1046 search results - page 96 / 210 » Approximation Algorithms for Domination Search |
114
Voted
SIGMOD
2004
ACM
16 years 22 days ago
2004
ACM
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
106
click to vote
DAC
2004
ACM
16 years 1 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
229
Voted
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
127
Voted
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...