2925 search results - page 204 / 585 » Information Complexity of Online Problems |
182
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
156
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
166
click to vote
TCS
2008
15 years 6 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
185
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
139
click to vote
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...