2638 search results - page 151 / 528 » Random Geometric Complexes |
190
click to vote
HPCC
2007
Springer
16 years 18 days ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
149
click to vote
PODC
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
123
click to vote
INFOCOM
2006
IEEE
16 years 14 days ago
2006
IEEE
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
151
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
147
click to vote
APLAS
2008
ACM
15 years 8 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...