Sciweavers

1434 search results - page 243 / 287
» Stochastic computation
Sort
View
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
15 years 2 months ago
Q-learning and Pontryagin's Minimum Principle
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...
Prashant G. Mehta, Sean P. Meyn
EUROPAR
2009
Springer
15 years 2 months ago
Real-Time Issues in Live Migration of Virtual Machines
This paper addresses the issue of how to meet the strict timing constraints of (soft) real-time virtualized applications while the Virtual Machine (VM) hosting them is undergoing a...
Fabio Checconi, Tommaso Cucinotta, Manuel Stein
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
15 years 2 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
KI
1999
Springer
15 years 2 months ago
Systematic vs. Local Search for SAT
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
Holger H. Hoos, Thomas Stützle
ECML
1993
Springer
15 years 1 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman