481 search results - page 89 / 97 » Martin's game: a lower bound for the number of sets |
WINE
2005
Springer
14 years 2 months 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...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
TSP
2011
13 years 3 months ago
2011
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
ALGORITHMICA
2002
13 years 8 months ago
2002
Abstract. We consider the tasks of testing and spot-checking for data streams. These testers and spotcheckers are potentially useful in real-time or near real-time applications tha...
ALENEX
2009
13 years 6 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...