2214 search results - page 293 / 443 » complexity 2004 |
129
click to vote
SIGECOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
140
click to vote
SIGECOM
2004
ACM
15 years 9 months ago
2004
ACM
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
115
click to vote
SIGOPSE
2004
ACM
15 years 9 months ago
2004
ACM
In this paper we argue that the best approach to providing Quality of Service (QoS) guarantees to current Internet services is to use admission control and traffic shaping techni...
158
click to vote
SLIP
2004
ACM
15 years 9 months ago
2004
ACM
Throughput, power consumption, signal integrity, pin count and routing complexity are all increasingly important interconnect issues that the system designer must deal with. Recen...
120
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...