10608 search results - page 402 / 2122 » Complexity of O'Hara's Algorithm |
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...
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...
127
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
122
click to vote
EUROPAR
2006
Springer
15 years 8 months ago
2006
Springer
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
122
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...