790 search results - page 111 / 158 » Subexponential Parameterized Algorithms |
134
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
Reinforcement learning (RL) was originally proposed as a framework to allow agents to learn in an online fashion as they interact with their environment. Existing RL algorithms co...
118
Voted
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
128
Voted
ADHOCNOW
2003
Springer
15 years 7 months ago
2003
Springer
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destinat...
147
click to vote
FCT
2007
Springer
15 years 6 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
103
Voted
CP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...