Sciweavers

1983 search results - page 42 / 397
» Competitive graph searches
Sort
View
EC
2006
153views ECommerce» more  EC 2006»
13 years 7 months ago
GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem
This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossov...
Frédéric Lardeux, Frédé...
JAIR
2007
114views more  JAIR 2007»
13 years 7 months ago
Marvin: A Heuristic Search Planner with Online Macro-Action Learning
This paper describes Marvin, a planner that competed in the Fourth International Planning Competition (IPC 4). Marvin uses action-sequence-memoisation techniques to generate macro...
Andrew Coles, Kate A. Smith
WWW
2010
ACM
14 years 2 months ago
Measurement-calibrated graph models for social network experiments
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
Alessandra Sala, Lili Cao, Christo Wilson, Robert ...
IJCNN
2007
IEEE
14 years 1 months ago
Search Strategies Guided by the Evidence for the Selection of Basis Functions in Regression
— This work addresses the problem of selecting a subset of basis functions for a model linear in the parameters for regression tasks. Basis functions from a set of candidates are...
Ignacio Barrio, Enrique Romero, Lluís Belan...
HM
2007
Springer
135views Optimization» more  HM 2007»
14 years 1 months ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik