Sciweavers

660 search results - page 24 / 132
» Hybrid CSP Solving
Sort
View
HM
2007
Springer
180views Optimization» more  HM 2007»
14 years 1 months ago
Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Wi...
Tonci Caric, Juraj Fosin, Ante Galic, Hrvoje Gold,...
ECAI
1992
Springer
14 years 1 months ago
Arc-Consistency for Non-Binary Dynamic CSPs
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
Christian Bessière
ICASSP
2011
IEEE
13 years 1 months ago
Classification by weighting for spatio-frequency components of EEG signal during motor imagery
We propose a novel method for the classification of EEG signals during motor-imagery. For motor-imagery based brain computer interface (MI-BCI), a method called common spatial pa...
Hiroshi Higashi, Toshihisa Tanaka
CP
2007
Springer
14 years 1 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
JACM
2010
116views more  JACM 2010»
13 years 8 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára