99 search results - page 4 / 20 » Path diversity is only part of the problem |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
PAM
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. IPv6 provides an expanded address space to satisfy the future Internet requirements. In this paper we compare and analyze onemonth measurements of the end-to-end IPv6 del...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
GECCO
2003
Springer
14 years 20 days ago
2003
Springer
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...