1982 search results - page 79 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
112
Voted
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
149
Voted
TSE
2010
14 years 9 months ago
2010
Genetic algorithms (GAs) have been applied previously to UML-driven, stress test requirements generation with the aim of increasing chances of discovering faults relating to networ...
196
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
229
Voted
TASE
2012
IEEE
13 years 10 months ago
2012
IEEE
— This paper presents new results on the formal design of distributed coordinating agents in a discrete-event framework. In this framework, agents are modeled to be individually ...
105
Voted
JSAT
2008
15 years 2 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...