Sciweavers

6365 search results - page 130 / 1273
» Fast Local Computation Algorithms
Sort
View
AINA
2007
IEEE
15 years 11 months ago
Event based Extensible Interactive Transparent Networking: Performance Study with Fast TCP Principles
Interactive Transparent Networking has been proposed to support a new generation of symbiotic applications that require advance interaction with the Network. In this mode advanced...
Javed I. Khan, Pradeep K. Punnam, Raid Zaghal
IPSN
2005
Springer
15 years 10 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
158
Voted
JCC
2006
110views more  JCC 2006»
15 years 4 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs
JCC
2008
166views more  JCC 2008»
15 years 4 months ago
Reference energy extremal optimization: A stochastic search algorithm applied to computational protein design
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
Naigong Zhang, Chen Zeng
DCOSS
2005
Springer
15 years 10 months ago
A Local Facility Location Algorithm for Sensor Networks
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
Denis Krivitski, Assaf Schuster, Ran Wolff