1952 search results - page 279 / 391 » Complete partitions of graphs |
206
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
137
click to vote
CIKM
2009
Springer
16 years 29 days ago
2009
Springer
PN refer to the set of ties a specific individual has with other people. There is significant variation in the size of an individual’s PN and this paper explores the effect o...
161
click to vote
FORMATS
2004
Springer
15 years 11 months ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
166
click to vote
DSVIS
1994
Springer
15 years 10 months ago
1994
Springer
This paper presents a complete model-based approach to the building of presentation for a business oriented highly interactive application. This approach is considered complete in...
204
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...