Sciweavers

4565 search results - page 729 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
EDCC
2008
Springer
15 years 2 months ago
Targeted Distribution of Resource Allocation for Backup LSP Computation
Under the hypothesis of single failures in the network, some backup paths cannot be active at the same time because they protect against the failure of different components. Hence...
Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le ...
MASCOTS
2010
15 years 2 months ago
Efficient Discovery of Loop Nests in Execution Traces
Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative beha...
Qiang Xu, Jaspal Subhlok, Nathaniel Hammen
106
Voted
AAAI
2004
15 years 2 months ago
A Comparison of Techniques for Scheduling Earth Observing Satellites
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...
Al Globus, James Crawford, Jason D. Lohn, Anna Pry...
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 2 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
98
Voted
AAAI
2000
15 years 2 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm