450 search results - page 59 / 90 » Estimating Search Tree Size |
132
click to vote
EMO
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds ...
135
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Portable embedded systems are being driven by consumer demands to be thermally efficient, perform faster, and have longer battery life. To design such a system, various hardware un...
139
click to vote
ALGORITHMICA
1998
15 years 2 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
136
click to vote
CMOT
2010
15 years 10 days ago
2010
Planning a path to a destination, given a number of options and obstacles, is a common task. We suggest a two-component cognitive model that combines retrieval of knowledge about t...
104
click to vote
SISAP
2008
IEEE
15 years 9 months ago
2008
IEEE
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...