285 search results - page 54 / 57 » The complexity of soft constraint satisfaction |
108
Voted
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
100
click to vote
ICML
2010
IEEE
15 years 21 days ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
89
Voted
DAC
2008
ACM
16 years 19 days ago
2008
ACM
Scenario-based design exploits the time-varying execution behavior of applications by dynamically adapting the system on which they run. This is a particularly interesting design ...
120
click to vote
KR
1992
Springer
15 years 3 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...