1982 search results - page 79 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
152
click to vote
ICML
2008
IEEE
16 years 7 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 ...
209
click to vote
TSE
2010
15 years 29 days 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...
252
click to vote
CVPR
2009
IEEE
16 years 10 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...
305
click to vote
TASE
2012
IEEE
14 years 1 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 ...
154
click to vote
JSAT
2008
15 years 6 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 ...