1197 search results - page 60 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
EAAI
2008
13 years 9 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
VLSID
2008
IEEE
14 years 9 months ago
2008
IEEE
Real-time embedded systems increasingly rely on dynamic power management to balance between power and performance goals. In this paper, we present a technique for continuous frequ...
BPM
2006
Springer
14 years 1 months ago
2006
Springer
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...
CONSTRAINTS
2006
13 years 9 months ago
2006
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
CP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...