Sciweavers

2403 search results - page 112 / 481
» Optimal Randomized RANSAC
Sort
View
PE
2008
Springer
108views Optimization» more  PE 2008»
15 years 3 months ago
Rate-optimal schemes for Peer-to-Peer live streaming
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
Laurent Massoulié, Andrew Twigg
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
15 years 8 months ago
Memory-based immigrants for genetic algorithms in dynamic environments
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent year...
Shengxiang Yang
AMAI
1999
Springer
15 years 2 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
FOCS
2006
IEEE
15 years 9 months ago
Fault-Tolerant Distributed Computing in Full-Information Networks
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(l...
Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanatha...
113
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Identification of ARMA models using intermittent and quantized output observations
This paper studies system identification of ARMA models whose outputs are subject to finite-level quantization and random packet dropouts. A simple adaptive quantizer and the co...
Damián Marelli, Keyou You, Minyue Fu