1381 search results - page 45 / 277 » Computational Complexity of Constraint Satisfaction |
129
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...
119
Voted
CP
1999
Springer
15 years 8 months ago
1999
Springer
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
135
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
151
Voted
SEMCO
2008
IEEE
15 years 10 months ago
2008
IEEE
We developed a novel analytical environment to aid in the examination of the extensive amount of interconnected data available for genome projects. Our focus is to enable ity and ...
126
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...