2861 search results - page 387 / 573 » Constraint Programming |
AI
2008
Springer
15 years 4 months ago
2008
Springer
A problem of intense interest to many sports fans as a season progresses is whether their favorite team has mathematically clinched a playoff spot; i.e., whether there is no possib...
119
Voted
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
101
Voted
EUROPAR
2008
Springer
15 years 4 months ago
2008
Springer
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
135
click to vote
BIRTHDAY
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We develop an abstract operational model for configuration management under service-oriented computing. This semantics is based on a graph-based representation of the con...
108
Voted
CPAIOR
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. In scheduling using constraint programming we usually reason only about possible start times and end times of activities and remove those which are recognized as unfeasib...