1046 search results - page 118 / 210 » Approximation Algorithms for Domination Search |
152
click to vote
LATIN
2004
Springer
15 years 8 months ago
2004
Springer
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
110
click to vote
ER
2003
Springer
15 years 8 months ago
2003
Springer
Existing solutions to data and schema integration require user interaction/input to generate a data transformation between two different schemas. These approaches are not appropri...
101
click to vote
CONSTRAINTS
2007
15 years 3 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
116
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
In the model-based policy search approach to reinforcement learning (RL), policies are found using a model (or "simulator") of the Markov decision process. However, for ...
134
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...