Sciweavers

1237 search results - page 142 / 248
» Abstract shade trees
Sort
View
ICALP
2009
Springer
14 years 10 months ago
When Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...
OOPSLA
2009
Springer
14 years 4 months ago
Coherent reaction
Side effects are both the essence and bane of imperative programming. The programmer must carefully coordinate actions to manage their side effects upon each other. Such coordinat...
Jonathan Edwards
INFOCOM
2008
IEEE
14 years 4 months ago
Temporal Delay Tomography
Abstract—Multicast-based network tomography enables inference of average loss rates and delay distributions of internal network links from end-to-end measurements of multicast pr...
Vijay Arya, Nick G. Duffield, Darryl Veitch
INFOCOM
2008
IEEE
14 years 4 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
CP
2007
Springer
14 years 4 months ago
Encodings of the Sequence Constraint
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...
Sebastian Brand, Nina Narodytska, Claude-Guy Quimp...