Sciweavers

8413 search results - page 1398 / 1683
» Ordering Problem Subgoals
Sort
View
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 4 months ago
Certifying cost annotations in compilers
We discuss the problem of building a compiler which can lift in a provably correct way pieces of information on the execution cost of the object code to cost annotations on the so...
Roberto M. Amadio, Nicholas Ayache, Yann Ré...
CORR
2008
Springer
74views Education» more  CORR 2008»
15 years 4 months ago
On Certain Large Random Hermitian Jacobi Matrices with Applications to Wireless Communications
In this paper we study the spectrum of certain large random Hermitian Jacobi matrices. These matrices are known to describe certain communication setups. In particular we are inte...
Nathan Levy, Oren Somekh, Shlomo Shamai, Ofer Zeit...
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 4 months ago
A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
Rohit Chadha, Mahesh Viswanathan
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 4 months ago
Dynamic System Adaptation by Constraint Orchestration
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
Luuk Groenewegen, Erik P. de Vink
CORR
2008
Springer
64views Education» more  CORR 2008»
15 years 4 months ago
Linearly Parameterized Bandits
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...
Paat Rusmevichientong, John N. Tsitsiklis
« Prev « First page 1398 / 1683 Last » Next »