Sciweavers

470 search results - page 27 / 94
» Tabu Search for SAT
Sort
View
KI
1999
Springer
13 years 12 months ago
Systematic vs. Local Search for SAT
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
Holger H. Hoos, Thomas Stützle
AE
2007
Springer
14 years 1 months ago
Generating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
Mohamed Bahy Bader-El-Den, Riccardo Poli
COR
2007
143views more  COR 2007»
13 years 7 months ago
Discrete bandwidth allocation considering fairness and transmission load in multicast networks
As a promising solution to tackle the network heterogeneity in multicasting, layered multicast protocols such as Receiver-driven layered multicast (RLM) and Layered video multicas...
Chae Y. Lee, Hee K. Cho
ICIAP
2005
ACM
14 years 7 months ago
Optimal Parameter Estimation for MRF Stereo Matching
Abstract. This paper presents an optimisation technique to select automatically a set of control parameters for a Markov Random Field applied to stereo matching. The method is base...
Riccardo Gherardi, Umberto Castellani, Andrea Fusi...
EOR
2008
107views more  EOR 2008»
13 years 7 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...