Sciweavers

633 search results - page 54 / 127
» Locality and Hard SAT-Instances
Sort
View
AAAI
1997
13 years 11 months ago
Tabu Search for SAT
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
Bertrand Mazure, Lakhdar Sais, Éric Gr&eacu...
IJCAI
1993
13 years 11 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe
ICCVG
2010
13 years 11 months ago
Visual Codebooks Survey for Video On-Line Processing
Abstract. This paper explores techniques in the pipeline of image description based on visual codebooks suitable for video on-line processing. The pipeline components are (i) extra...
Vítezslav Beran, Pavel Zemcík
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 10 months ago
Quantifying Homology Classes
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
Chao Chen, Daniel Freedman
AMC
2006
115views more  AMC 2006»
13 years 10 months ago
A memetic algorithm for a vehicle routing problem with backhauls
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
Reza Tavakkoli-Moghaddam, A. R. Saremi, M. S. Ziae...