Sciweavers

729 search results - page 33 / 146
» Solving subgraph isomorphism problems with constraint progra...
Sort
View
113
Voted
ANOR
2002
99views more  ANOR 2002»
15 years 3 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...
CSCLP
2004
Springer
15 years 9 months ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
99
Voted
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 3 months ago
Adaptive Methods for Linear Programming Decoding
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
Mohammad H. Taghavi, Paul H. Siegel
136
Voted
AIPS
2007
15 years 5 months ago
Temporally-Expressive Planning as Constraint Satisfaction Problems
Due to its important practical applications, temporal planning is of great research interest in artificial intelligence. Yet most of the work in this area so far is limited in at...
Yuxiao Hu
161
Voted
DM
2006
128views more  DM 2006»
15 years 3 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck