16188 search results - page 2720 / 3238 » The Optimal PAC Algorithm |
192
click to vote
ICALP
2005
Springer
16 years 14 days ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
197
click to vote
ICALP
2005
Springer
16 years 14 days ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
176
click to vote
WINE
2005
Springer
16 years 13 days ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
210
click to vote
MOBIHOC
2004
ACM
16 years 12 days ago
2004
ACM
In this work, we develop an analytical framework to investigate the behavior of the communication links of a node in a random mobility environment. Analytical expressions characte...
202
click to vote
GECCO
2004
Springer
16 years 10 days ago
2004
Springer
Abstract. The need for supporting CSCW applications with heterogeneous and varying user requirements calls for adaptive and reconfigurable schedulers accommodating a mixture of re...