Sciweavers

2542 search results - page 167 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
107
Voted
IPPS
2007
IEEE
15 years 7 months ago
Optimizing Sorting with Machine Learning Algorithms
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
Xiaoming Li, María Jesús Garzar&aacu...
114
Voted
JVA
2006
IEEE
15 years 7 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
87
Voted
UC
2009
Springer
15 years 7 months ago
Resource-Competing Oscillator Network as a Model of Amoeba-Based Neurocomputer
Abstract. An amoeboid organism, Physarum, exhibits rich spatiotemporal oscillatory behavior and various computational capabilities. Previously, the authors created a recurrent neur...
Masashi Aono, Yoshito Hirata, Masahiko Hara, Kazuy...
134
Voted
TWC
2010
14 years 7 months ago
Distributed Node Selection for Sequential Estimation over Noisy Communication Channels
This paper proposes a framework for distributed sequential parameter estimation in wireless sensor networks. In the proposed scheme, the estimator is updated sequentially at the c...
Thakshila Wimalajeewa, Sudharman K. Jayaweera
127
Voted
EUROGP
2007
Springer
171views Optimization» more  EUROGP 2007»
15 years 2 months ago
Geometric Particle Swarm Optimisation
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Cecilia Di Chio, Riccardo Poli