1068 search results - page 30 / 214 » On Space Bounded Server Algorithms |
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
CP
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
SLSFS
2005
Springer
14 years 1 months ago
2005
Springer
We present a method which uses example pairs of equal or unequal class labels to select a subspace with near optimal metric properties in a kernel-induced Hilbert space. A represen...