2303 search results - page 140 / 461 » Interior-Point Methods in Parallel Computation |
131
click to vote
SPIN
2007
Springer
15 years 9 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
121
Voted
CP
2004
Springer
15 years 8 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...
107
click to vote
CONCUR
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]....
121
Voted
CONCUR
1998
Springer
15 years 7 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
118
click to vote
IPPS
1996
IEEE
15 years 7 months ago
1996
IEEE
We describe the adaptive source routing (ASR) method which is a first attempt to combine adaptive routing and source routing methods. In ASR, the adaptivity of each packet is dete...