986 search results - page 67 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
116
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
122
Voted
WAOA
2004
Springer
15 years 8 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
127
click to vote
DCC
2010
IEEE
15 years 10 months ago
2010
IEEE
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
169
Voted
CEC
2010
IEEE
14 years 7 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
135
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...