Sciweavers

2109 search results - page 106 / 422
» Solving Necklace Constraint Problems
Sort
View
123
Voted
JUCS
2006
97views more  JUCS 2006»
15 years 5 months ago
An Interval Constraint Branching Scheme for Lattice Domains
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
Antonio J. Fernández, Patricia M. Hill
135
Voted
CP
2004
Springer
15 years 10 months ago
Leveraging the Learning Power of Examples in Automated Constraint Acquisition
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
Christian Bessière, Remi Coletta, Eugene C....
ANOR
2007
108views more  ANOR 2007»
15 years 5 months ago
Towards a practical engineering tool for rostering
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...
Edward P. K. Tsang, John A. Ford, Patrick Mills, R...
163
Voted
CONSTRAINTS
2007
89views more  CONSTRAINTS 2007»
15 years 5 months ago
Cardinal: A Finite Sets Constraint Solver
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
Francisco Azevedo
GLOBECOM
2008
IEEE
15 years 11 months ago
SINR Balancing for the Multi-User Downlink under General Power Constraints
Abstract—We address the problem of maximizing the minimum signal to interference and noise ratio of individual users via linear precoding in a multiuser downlink channel with mul...
Albrecht J. Fehske, Fred Richter, Gerhard Fettweis