Sciweavers

150 search results - page 7 / 30
» Solving Small TSPs with Constraints
Sort
View
AAAI
2008
13 years 10 months ago
Anytime Local Search for Distributed Constraint Optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
Roie Zivan
FLAIRS
2007
13 years 10 months ago
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
Pavel Surynek, Roman Barták
ANOR
2002
99views more  ANOR 2002»
13 years 7 months ago
A General Approach to the Physician Rostering Problem
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...
IJCV
2000
195views more  IJCV 2000»
13 years 7 months ago
Optical Flow Constraints on Deformable Models with Applications to Face Tracking
Optical flow provides a constraint on the motion of a deformable model. We derive and solve a dynamic system incorporating flow as a hard constraint, producing a model-based least...
Douglas DeCarlo, Dimitris N. Metaxas
ICFP
2008
ACM
14 years 7 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy