4843 search results - page 294 / 969 » The Shortcut Problem - Complexity and Approximation |
152
click to vote
DMSN
2004
ACM
15 years 9 months ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
110
click to vote
EVOW
1999
Springer
15 years 8 months ago
1999
Springer
This paper describes a new approximate approach for checking the correctness of the implementation of a protocol interface, comparing its lowlevel implementation with its high-leve...
132
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
137
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
137
click to vote
ISLPED
2007
ACM
15 years 5 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...