Sciweavers

3008 search results - page 430 / 602
» Independence in connected graphs
Sort
View
CIA
2007
Springer
15 years 11 months ago
Methods for Coalition Formation in Adaptation-Based Social Networks
: Coalition formation in social networks consisting of a graph of interdependent agents allows many choices of which task to select and with whom to partner in the social network. ...
Levi Barton, Vicki H. Allan
FORMATS
2006
Springer
15 years 10 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
CASES
2001
ACM
15 years 10 months ago
Computation offloading to save energy on handheld devices: a partition scheme
We consider handheld computing devices which are connected to a server (or a powerful desktop machine) via a wireless LAN. On such devices, it is often possible to save the energy...
Zhiyuan Li, Cheng Wang, Rong Xu
IPPS
1995
IEEE
15 years 10 months ago
Performance evaluation of a new parallel preconditioner
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
Keith D. Gremban, Gary L. Miller, Marco Zagha
FOCS
1994
IEEE
15 years 10 months ago
Finding the k Shortest Paths
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
David Eppstein