5316 search results - page 266 / 1064 » Which Search Problems Are Random |
122
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...
143
click to vote
DBSEC
2010
15 years 6 months ago
2010
This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, formulated as follows: a client has a DNA sequence, and a service provid...
143
Voted
AAAI
1996
15 years 6 months ago
1996
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
172
click to vote
MMB
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
202
click to vote
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...