Sciweavers

435 search results - page 8 / 87
» Methods to Learn Abstract Scheduling Models
Sort
View
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
14 years 1 days ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
AI
1998
Springer
13 years 7 months ago
Model-Based Average Reward Reinforcement Learning
Reinforcement Learning (RL) is the study of programs that improve their performance by receiving rewards and punishments from the environment. Most RL methods optimize the discoun...
Prasad Tadepalli, DoKyeong Ok
WINE
2005
Springer
136views Economy» more  WINE 2005»
14 years 29 days ago
Click Fraud Resistant Methods for Learning Click-Through Rates
Abstract. In pay-per-click online advertising systems like Google, Overture, or MSN, advertisers are charged for their ads only when a user clicks on the ad. While these systems ha...
Nicole Immorlica, Kamal Jain, Mohammad Mahdian, Ku...
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 6 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
MEMOCODE
2003
IEEE
14 years 23 days ago
MoDe: A Method for System-Level Architecture Evaluation
System-level design methodologies for embedded HW/SW systems face several challenges: In order to be susceptible to systematic formal analysis based on state-space exploration, a ...
Jan Romberg, Oscar Slotosch, Gabor Hahn