Sciweavers

2109 search results - page 53 / 422
» Solving Necklace Constraint Problems
Sort
View
ACISICIS
2007
IEEE
15 years 10 months ago
A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
Mauritsius Tuga, Regina Berretta, Alexandre Mendes
AISC
2004
Springer
15 years 10 months ago
Combination of Nonlinear Terms in Interval Constraint Satisfaction Techniques
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
Laurent Granvilliers, Mina Ouabiba
ANOR
2008
171views more  ANOR 2008»
15 years 4 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
ICASSP
2011
IEEE
14 years 8 months ago
Joint bandwidth and power allocation in cognitive radio networks under fading channels
A problem of joint optimal bandwidth and power allocation in cognitive networks under fading channels is considered. It is assumed that multiple secondary users (SUs) share the sp...
Xiaowen Gong, Sergiy A. Vorobyov, Chintha Tellambu...
CPAIOR
2004
Springer
15 years 8 months ago
A Global Constraint for Graph Isomorphism Problems
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
Sébastien Sorlin, Christine Solnon