505 search results - page 19 / 101 » On the Minimality and Decomposability of Constraint Networks |
SUTC
2010
IEEE
13 years 6 months ago
2010
IEEE
We consider a team of mobile agents where a leader has to monitor battery levels of all other agents. Only the leader is capable to transmit information to other agents. Every now...
TCAD
1998
13 years 8 months ago
1998
Abstract—This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology lib...
CP
2004
Springer
14 years 1 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
TC
2008
13 years 8 months ago
2008
Next-generation scientific applications require the capability to visualize large archival data sets or on-going computer simulations of physical and other phenomena over wide-area...
QOSIP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The topological design of distributed packet switched networks consists of finding a topology that minimizes the communication costs by taking into account a certain num...