Sciweavers

1971 search results - page 267 / 395
» Tabu search - Uncharted domains
Sort
View
CONSTRAINTS
2007
93views more  CONSTRAINTS 2007»
15 years 6 months ago
Arc-B-consistency of the Inter-distance Constraint
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
Konstantin Artiouchine, Philippe Baptiste
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 6 months ago
Association Rules in the Relational Calculus
One of the most utilized data mining tasks is the search for association rules. Association rules represent significant relationships between items in transactions. We extend the...
Oliver Schulte, Flavia Moser, Martin Ester, Zhiyon...
JOT
2006
92views more  JOT 2006»
15 years 6 months ago
A Rule-Based Approach to Framework Evolution
Framework development is very expensive, not only because of the intrinsic difficulty related to capturing the domain knowledge, but also because of the lack of appropriate method...
Mariela Cortés, Marcus Fontoura, Carlos Jos...
ESWA
2007
131views more  ESWA 2007»
15 years 6 months ago
Case-based selection of initialisation heuristics for metaheuristic examination timetabling
Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many...
Sanja Petrovic, Yong Yang, Moshe Dror
AICOM
2004
92views more  AICOM 2004»
15 years 6 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu