492 search results - page 85 / 99 » The number of possibilities for random dating |
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
LCN
2003
IEEE
14 years 2 months ago
2003
IEEE
Sensor networks are meant for sensing and disseminating information about the environment they sense. The criticality of a sensed phenomenon determines it’s importance to the en...
LICS
2000
IEEE
14 years 1 months ago
2000
IEEE
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
COCO
2006
Springer
14 years 15 days ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
NIPS
2004
13 years 10 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...