361 search results - page 1 / 73 » Algorithms for Extracting Timeliness Graphs |
105
Voted
SIROCCO
2010
15 years 15 days ago
2010
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
113
click to vote
TKDE
2012
13 years 1 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
124
Voted
AAMAS
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
AIPS
2000
15 years 13 days ago
2000
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
107
click to vote
ICST
2010
IEEE
14 years 9 months ago
2010
IEEE
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...