5214 search results - page 109 / 1043 » The Online Specialization Problem |
123
click to vote
INFORMATICALT
2010
15 years 1 months ago
2010
We present a novel dynamic network interdiction model that accounts for interactions between an interdictor deploying resources on arcs in a digraph and an evader traversing the ne...
174
Voted
WADS
2009
Springer
15 years 10 months ago
2009
Springer
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
127
Voted
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
140
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
A number of updates for density matrices have been developed recently that are motivated by relative entropy minimization problems. The updates involve a softmin calculation based...
131
Voted
ETS
2000
IEEE
15 years 3 months ago
2000
IEEE
In recent years, there is a growing interest in developing online collaborative learning environments. In a learner-centered online collaborative environment, students work togeth...