1206 search results - page 181 / 242 » Arc-Flags in Dynamic Graphs |
SAT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
DIALM
2004
ACM
14 years 2 months ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
SC
2004
ACM
14 years 2 months ago
2004
ACM
Virtual machines provide flexible, powerful execution environments for Grid computing, offering isolation and security mechanisms complementary to operating systems, customization...
SIGCOMM
2004
ACM
14 years 2 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...