Sciweavers

8933 search results - page 297 / 1787
» Usability over time
Sort
View
DAC
2000
ACM
16 years 7 months ago
Memory aware compilation through accurate timing extraction
Memory delays represent a major bottleneck in embedded systems performance. Newer memory modules exhibiting efficient access modes (e.g., page-, burst-mode) partly alleviate this ...
Peter Grun, Nikil D. Dutt, Alexandru Nicolau
ICML
2009
IEEE
16 years 7 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
COMPSAC
2009
IEEE
16 years 1 months ago
Real-Time Guarantees in Flexible Advance Reservations
—This paper deals with the problem of scheduling workflow applications with Quality of Service (QoS) constraints, comprising real-time and interactivity constraints, over a servi...
Kleopatra Konstanteli, Dimosthenis Kyriazis, Theod...
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
16 years 1 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...
PKDD
2009
Springer
155views Data Mining» more  PKDD 2009»
16 years 1 months ago
Dynamic Factor Graphs for Time Series Modeling
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
Piotr W. Mirowski, Yann LeCun