3946 search results - page 270 / 790 » The computational complexity of choice sets |
139
click to vote
ICDCS
2005
IEEE
16 years 10 days ago
2005
IEEE
We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing...
160
click to vote
BIRTHDAY
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-...
210
click to vote
ECML
2005
Springer
16 years 8 days ago
2005
Springer
Partially Observable Markov Decision Processes (POMDP) provide a standard framework for sequential decision making in stochastic environments. In this setting, an agent takes actio...
172
Voted
PPSN
2004
Springer
16 years 2 days ago
2004
Springer
In Multi-Agent learning, agents must learn to select actions that maximize their utility given the action choices of the other agents. Cooperative Coevolution offers a way to evol...
189
Voted
DSN
2000
IEEE
15 years 11 months ago
2000
IEEE
Although Microsoft Windows is being deployed in mission-critical applications, little quantitative data has been published about its robustness. We present the results of executin...