Sciweavers

17329 search results - page 2939 / 3466
» Improved non-approximability results
Sort
View
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 7 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
CORR
2010
Springer
91views Education» more  CORR 2010»
15 years 7 months ago
Fundamental Limits of Wideband Localization - Part II: Cooperative Networks
The availability of positional information is of great importance in many commercial, governmental, and military applications. Localization is commonly accomplished through the use...
Yuan Shen, Henk Wymeersch, Moe Z. Win
CONCURRENCY
2008
102views more  CONCURRENCY 2008»
15 years 7 months ago
Dynamic data replication in LCG 2008
To provide performant access to data from high energy physics experiments such as the Large Hadron Collider (LHC), controlled replication of files among grid sites is required. Dy...
Caitriana Nicholson, David G. Cameron, A. T. Doyle...
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 7 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 7 months ago
Secured Greedy Perimeter Stateless Routing for Wireless Sensor Networks
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the n...
P. Samundiswary, D. Sathian, P. Dananjayan
« Prev « First page 2939 / 3466 Last » Next »