Sciweavers

1197 search results - page 211 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
NETWORKING
2008
13 years 9 months ago
DBR: Depth-Based Routing for Underwater Sensor Networks
Abstract. Providing scalable and efficient routing services in underwater sensor networks (UWSNs) is very challenging due to the unique characteristics of UWSNs. Firstly, UWSNs oft...
Hai Yan, Zhijie Jerry Shi, Jun-Hong Cui
ICDCN
2011
Springer
12 years 11 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
SECON
2010
IEEE
13 years 5 months ago
Utility-Based Gateway Deployment for Supporting Multi-Domain DTNs
Abstract--Due to technology or policy constraints, communications across network domains usually require the intervention of gateways, and their proper deployment is crucial to the...
Ting He, Kang-Won Lee, Nikoletta Sofra, Kin K. Leu...
KES
2006
Springer
13 years 8 months ago
Robust Positioning a Mobile Robot with Active Beacon Sensors
With the development of service robots and with the emerging concept of the ubiquitous world, localization of a mobile robot has become a popular issue. Even though several localiz...
JaeMu Yun, SungBu Kim, JangMyung Lee
FOCS
2007
IEEE
14 years 2 months ago
The Power of Quantum Systems on a Line
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
Dorit Aharonov, Daniel Gottesman, Sandy Irani, Jul...