Sciweavers

3510 search results - page 21 / 702
» Searching with numbers
Sort
View
AI
2006
Springer
13 years 11 months ago
On the Quality and Quantity of Random Decisions in Stochastic Local Search for SAT
Stochastic local search (SLS) methods are underlying some of the best-performing algorithms for certain types of SAT instances, both from an empirical as well as from a theoretical...
Dave A. D. Tompkins, Holger H. Hoos
DISOPT
2011
210views Education» more  DISOPT 2011»
13 years 2 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider
ADHOC
2007
101views more  ADHOC 2007»
13 years 7 months ago
Searching strategies for target discovery in wireless networks
— In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In o...
Zhao Cheng, Wendi B. Heinzelman
HCI
2009
13 years 5 months ago
An Analysis of Eye Movements during Browsing Multiple Search Results Pages
In general, most search engines display a certain number of search results on a search results page at one time, separating the entire search results into multiple search results p...
Yuko Matsuda, Hidetake Uwano, Masao Ohira, Ken-ich...
ILP
2004
Springer
14 years 23 days ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...