Sciweavers

1274 search results - page 213 / 255
» New Proofs for
Sort
View
AGP
2010
IEEE
13 years 6 months ago
Concurrent and Reactive Constraint Programming
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...
Maurizio Gabbrielli, Catuscia Palamidessi, Frank D...
ICCAD
2010
IEEE
229views Hardware» more  ICCAD 2010»
13 years 6 months ago
Obstacle-avoiding rectilinear Steiner minimum tree construction: An optimal approach
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
Tao Huang, Evangeline F. Y. Young
ICDCS
2010
IEEE
13 years 6 months ago
Safe and Stabilizing Distributed Cellular Flows
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...
Taylor Johnson, Sayan Mitra, Karthik Manamcheri
IMCSIT
2010
13 years 6 months ago
BeesyBees - Efficient and Reliable Execution of Service-based Workflow Applications for BeesyCluster using Distributed Agents
Abstract--The paper presents an architecture and implementation that allows distributed execution of workflow applications in BeesyCluster using agents. BeesyCluster is a middlewar...
Pawel Czarnul, Mariusz R. Matuszek, Michal W&oacut...
CP
2009
Springer
13 years 6 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey