Sciweavers

167 search results - page 8 / 34
» Adaptive Searching in One and Two Dimensions
Sort
View
AAAI
1993
14 years 11 months ago
Scientific Model-Building as Search in Matrix Spaces
Many reported discovery systems build discrete models of hidden structure, properties, or processes in the diverse fields of biology, chemistry, and physics. We show that the sear...
Raúl E. Valdés-Pérez, Jan M. ...
CP
2008
Springer
14 years 11 months ago
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
Wanxia Wei, Chu Min Li, Harry Zhang
WADS
2001
Springer
137views Algorithms» more  WADS 2001»
15 years 2 months ago
Visual Ranking of Link Structures
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...
Ulrik Brandes, Sabine Cornelsen
CEC
2010
IEEE
14 years 10 months ago
Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
Edmund K. Burke, Timothy Curtois, Matthew R. Hyde,...
MP
2008
129views more  MP 2008»
14 years 9 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra