Sciweavers

1206 search results - page 194 / 242
» Convergence analysis of online algorithms
Sort
View
IPL
2010
112views more  IPL 2010»
13 years 7 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
JSW
2010
83views more  JSW 2010»
13 years 7 months ago
Estimating Model Parameters of Conditioned Soils by using Artificial Network
—The parameter identification of nonlinear constitutive model of soil mass is based on an inverse analysis procedure, which consists of minimizing the objective function represen...
Zichang Shangguan, Shouju Li, Wei Sun, Maotian Lua...
TCOM
2010
111views more  TCOM 2010»
13 years 6 months ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...
TVCG
2010
186views more  TVCG 2010»
13 years 6 months ago
An Information-Theoretic Framework for Flow Visualization
—The process of visualization can be seen as a visual communication channel where the input to the channel is the raw data, and the output is the result of a visualization algori...
Lijie Xu, Teng-Yok Lee, Han-Wei Shen
HIS
2009
13 years 6 months ago
On Some Properties of the lbest Topology in Particle Swarm Optimization
: Particle Swarm Optimization (PSO) is arguably one of the most popular nature- inspired algorithms for real parameter optimization at present. The existing theoretical research on...
Sayan Ghosh, Debarati Kundu, Kaushik Suresh, Swaga...