Sciweavers

335 search results - page 53 / 67
» Solving the Hamiltonian path problem with a light-based comp...
Sort
View
MOBIHOC
2005
ACM
14 years 7 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
MOBIHOC
2005
ACM
14 years 7 months ago
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...
Jian Tang, Guoliang Xue, Weiyi Zhang
BROADNETS
2006
IEEE
13 years 11 months ago
Wavelength Assignment in Optical Networks with Imprecise Network State Information
Efficient routing and wavelength assignment (RWA) in wavelength-routed all-optical networks is critical for achieving high efficiency over the backbone links. Extensive research ha...
Satyajeet Ahuja, Marwan Krunz, Srinivasan Ramasubr...
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 1 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
ICPP
2006
IEEE
14 years 1 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri