1952 search results - page 376 / 391 » Complete partitions of graphs |
180
click to vote
CONCUR
1998
Springer
15 years 8 months ago
1998
Springer
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
115
click to vote
CLUSTER
2004
IEEE
15 years 8 months ago
2004
IEEE
The Rocks toolkit [9], [7], [10] uses a graph-based framework to describe the configuration of all node types (termed appliances) that make up a complete cluster. With hundreds of...
163
click to vote
CHARME
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
154
click to vote
SIGGRAPH
1997
ACM
15 years 7 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
141
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...