1532 search results - page 92 / 307 » Connection Relations in Mereotopology |
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—Underwater mobile acoustic sensor networks are promising tools for the exploration of the oceans. These networks require new robust solutions for fundamental issues such as: loc...
CPAIOR
2007
Springer
15 years 4 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
IWSOS
2007
Springer
15 years 4 months ago
2007
Springer
A routing protocol is designed considering a particular environment all the time which is not possible in the case of practical ad hoc networks. Because of the uncertainty in topol...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
COCO
2004
Springer
15 years 3 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...