Sciweavers

632 search results - page 109 / 127
» On Routing in Circulant Graphs
Sort
View
ICNP
2007
IEEE
14 years 2 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
MP
1998
136views more  MP 1998»
13 years 8 months ago
Minimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
Daniel Bienstock, Sunil Chopra, Oktay Günl&uu...
DAC
2002
ACM
14 years 9 months ago
Solving difficult SAT instances in the presence of symmetry
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
ICCCN
2008
IEEE
14 years 2 months ago
TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs
—The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK — a no...
Avinash Srinivasan, Jie Wu
3DGIS
2006
Springer
14 years 2 months ago
3D Navigation for 3D-GIS - Initial Requirements
The needs for three-dimensional (3D) visualization and navigation within 3D-GIS environment are growing and expanding rapidly in a variety of fields. In a steady shift from tradit...
Ivin Amri Musliman, Alias Abdul-Rahman, Volker Coo...