Sciweavers

805 search results - page 46 / 161
» Enumerating All Solutions for Constraint Satisfaction Proble...
Sort
View
CP
2007
Springer
15 years 6 months ago
Dealing with Incomplete Preferences in Soft Constraint Problems
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
ATMOS
2007
152views Optimization» more  ATMOS 2007»
15 years 1 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth
CONSTRAINTS
2002
107views more  CONSTRAINTS 2002»
14 years 11 months ago
Fourier Elimination for Compiling Constraint Hierarchies
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
Warwick Harvey, Peter J. Stuckey, Alan Borning
ACISICIS
2007
IEEE
15 years 6 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
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
15 years 3 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag