16596 search results - page 455 / 3320 » Generalized Assignment Problems |
178
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
186
click to vote
DSN
2006
IEEE
16 years 1 months ago
2006
IEEE
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
195
click to vote
CP
2005
Springer
16 years 1 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
203
click to vote
GECCO
2005
Springer
16 years 1 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
186
click to vote
SAS
2005
Springer
16 years 1 months ago
2005
Springer
The termination insensitive secure information flow problem can be reduced to solving a safety problem via a simple program transformation. Barthe, D’Argenio, and Rezk coined th...