Sciweavers

796 search results - page 143 / 160
» Graph Properties Based Filtering
Sort
View
CONEXT
2007
ACM
15 years 1 months ago
The diameter of opportunistic mobile networks
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
Augustin Chaintreau, Abderrahmen Mtibaa, Laurent M...
FLAIRS
2003
14 years 10 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
14 years 10 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
DEXA
2010
Springer
182views Database» more  DEXA 2010»
14 years 9 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
CN
2010
103views more  CN 2010»
14 years 9 months ago
Continuum equilibria and global optimization for routing in dense static ad hoc networks
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...