Sciweavers

689 search results - page 79 / 138
» Optimal Segmentation Using Tree Models
Sort
View
GECCO
2005
Springer
14 years 1 months ago
Using gene deletion and gene duplication in evolution strategies
Self-adaptation of the mutation strengths is a powerful mechanism in evolution strategies (ES), but it can fail. As a consequence premature convergence or ending up in a local opt...
Karlheinz Schmitt
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 10 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
ICC
2009
IEEE
197views Communications» more  ICC 2009»
14 years 2 months ago
A Game-Based Self-Organizing Uplink Tree for VoIP Services in IEEE 802.16j Networks
— In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their s...
Walid Saad, Zhu Han, Mérouane Debbah, Are H...
GCC
2004
Springer
14 years 1 months ago
Efficient Search Using Adaptive Metadata Spreading in Peer-to-Peer Networks
Abstract. Search is until now a difficult problem in peer-to-peer (P2P) filesharing systems. In this paper, we propose to use adaptive metadata spreading to make search in P2P netw...
Xuezheng Liu, Guangwen Yang, Ming Chen, Yongwei Wu
SIROCCO
2008
13 years 9 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...