5138 search results - page 850 / 1028 » Randomized Algorithms for 3-SAT |
197
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
191
click to vote
NLPRS
2001
Springer
15 years 11 months ago
2001
Springer
Recent research in automated learning has focused on algorithms that learn from a combination of tagged and untagged data. Such algorithms can be referred to as semi-supervised in...
189
click to vote
ECCV
2000
Springer
15 years 10 months ago
2000
Springer
This paper offers a novel detection method, which works well even in the case of a complicated image collection – for instance, a frontal face under a large class of linear tran...
152
click to vote
PODS
1999
ACM
15 years 10 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
200
click to vote
ASIAN
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...