Sciweavers

1971 search results - page 104 / 395
» Tabu search - Uncharted domains
Sort
View
ILP
2004
Springer
15 years 11 months 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...
AAAI
1993
15 years 7 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk
CPAIOR
2007
Springer
16 years 15 days ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter
FLAIRS
2004
15 years 7 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
DILS
2010
Springer
15 years 7 months ago
Search Computing: Integrating Ranked Data in the Life Sciences
Search computing has been proposed to support the integration of the results of search engines with other data and computational resources. In essence, in search computing, search ...
Marco Masseroli, Norman W. Paton, Giorgio Ghisalbe...