Sciweavers

9477 search results - page 1663 / 1896
» Design is as Easy as Optimization
Sort
View
JMLR
2006
116views more  JMLR 2006»
15 years 6 months ago
Point-Based Value Iteration for Continuous POMDPs
We propose a novel approach to optimize Partially Observable Markov Decisions Processes (POMDPs) defined on continuous spaces. To date, most algorithms for model-based POMDPs are ...
Josep M. Porta, Nikos A. Vlassis, Matthijs T. J. S...
MANSCI
2008
68views more  MANSCI 2008»
15 years 6 months ago
Queuing for Expert Services
We consider a monopolist expert offering a service with a `credence' characteristic. A credence service is one where the customer cannot verify, even after a purchase, whethe...
Laurens G. Debo, L. Beril Toktay, Luk N. Van Wasse...
JOT
2006
113views more  JOT 2006»
15 years 6 months ago
Constraint Validation in Model Compilers
Model transformation has become one of the most focused research field, motivated by for instance the OMG's Model-Driven Architecture (MDA). Metamodeling is a central techniq...
László Lengyel, Tihamer Levendovszky...
JPDC
2006
112views more  JPDC 2006»
15 years 6 months ago
CEFT: A cost-effective, fault-tolerant parallel virtual file system
The vulnerability of computer nodes due to component failures is a critical issue for cluster-based file systems. This paper studies the development and deployment of mirroring in...
Yifeng Zhu, Hong Jiang
ENTCS
2007
121views more  ENTCS 2007»
15 years 6 months ago
Incremental Parametric Development of Greedy Algorithms
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
Dominique Cansell, Dominique Méry
« Prev « First page 1663 / 1896 Last » Next »