2343 search results - page 137 / 469 » The Locomotive Routing Problem |
138
Voted
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
173
click to vote
NETWORKS
2006
15 years 6 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
173
click to vote
ICNC
2005
Springer
15 years 11 months ago
2005
Springer
In order to overcome the drawbacks of mathematical optimization techniques, soft computing algorithms have been vigorously introduced during the past decade. However, there are sti...
167
Voted
ECCC
2007
15 years 6 months ago
2007
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
196
click to vote
GLOBECOM
2008
IEEE
16 years 16 days ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...