681 search results - page 72 / 137 » Searching with expectations |
SAT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics for solving optimization problems. We focus on evolutionary algorithms as well ...
UIST
2003
ACM
15 years 5 months ago
2003
ACM
Cascading menus are commonly seen in most GUI systems. However, people sometimes choose the wrong items by mistake, or become frustrated when submenus pop up unnecessarily. This p...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. This paper presents a theoretical study of the selection pressure in asynchronous cellular evolutionary algorithms (cEAs). This work is motivated by the search for a gene...
HICSS
2002
IEEE
15 years 4 months ago
2002
IEEE
Individual differences make it difficult to recognize similarities between individuals in eye movement patterns. However, if consistencies can be found, eye movements could be use...