Sciweavers

10575 search results - page 1910 / 2115
» Programming Languages
Sort
View
113
Voted
ICALP
2009
Springer
16 years 2 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...
97
Voted
ICALP
2009
Springer
16 years 2 months ago
Smoothed Analysis of Balancing Networks
Abstract In a load balancing network each processor has an initial collection of unit-size jobs, tokens, and in each round, pairs of processors connected by balancers split their l...
Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
147
Voted
ICALP
2009
Springer
16 years 2 months ago
Rumor Spreading in Social Networks
Social networks are an interesting class of graphs likely to become of increasing importance in the future, not only theoretically, but also for its probable applications to ad hoc...
Flavio Chierichetti, Silvio Lattanzi, Alessandro P...
135
Voted
CP
2009
Springer
15 years 9 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan
134
Voted
CP
2009
Springer
15 years 9 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
« Prev « First page 1910 / 2115 Last » Next »