Sciweavers

4047 search results - page 237 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Constraint relaxation in approximate linear programs
Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for...
Marek Petrik, Shlomo Zilberstein
HASE
2008
IEEE
16 years 27 days ago
A Grammar-Based Reverse Engineering Framework for Behavior Verification
A high assurance system requires both functional and nonfunctional correctness before the system is put into operation. To examine whether a system’s actual performance complies...
Chunying Zhao, Kang Zhang
ECML
2005
Springer
15 years 12 months ago
Active Learning in Partially Observable Markov Decision Processes
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
Robin Jaulmes, Joelle Pineau, Doina Precup
COORDINATION
2006
Springer
15 years 10 months ago
Atomic Commit and Negotiation in Service Oriented Computing
In this paper we investigate the relationship between two problems, related to distributed systems, that are of particular interest in the context of Service Oriented Computing: at...
Laura Bocchi, Roberto Lucchi
IOR
2008
62views more  IOR 2008»
15 years 6 months ago
Improved Bounds for the Symmetric Rendezvous Value on the Line
A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance apar...
Qiaoming Han, Donglei Du, Juan Vera, Luis F. Zulua...