Sciweavers

187 search results - page 10 / 38
» Limits and Possibilities of BDDs in State Space Search
Sort
View
ICSE
2008
IEEE-ACM
15 years 10 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su
ICML
1994
IEEE
15 years 29 days ago
Learning Without State-Estimation in Partially Observable Markovian Decision Processes
Reinforcement learning (RL) algorithms provide a sound theoretical basis for building learning control architectures for embedded agents. Unfortunately all of the theory and much ...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
MASCOTS
2008
14 years 11 months ago
Finding Good Configurations in High-Dimensional Spaces: Doing More with Less
Manually tuning tens to hundreds of configuration parameters in a complex software system like a database or an application server is an arduous task. Recent work has looked into ...
Risi Thonangi, Vamsidhar Thummala, Shivnath Babu
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
15 years 10 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert
GI
2009
Springer
14 years 7 months ago
Towards a Parallel Search for Solutions of Non-deterministic Computations
: In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We present three different approaches to this problem:...
Fabian Reck, Sebastian Fischer