Sciweavers

1977 search results - page 184 / 396
» The satisfactory partition problem
Sort
View
TOPNOC
2010
15 years 1 months ago
Search-Order Independent State Caching
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
Sami Evangelista, Lars Michael Kristensen

Publication
252views
15 years 9 months ago
Context models on sequences of covers
We present a class of models that, via a simple construction, enables exact, incremental, non-parametric, polynomial-time, Bayesian inference of conditional measures. The approac...
Christos Dimitrakakis
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
16 years 1 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
ETFA
2005
IEEE
16 years 6 days ago
Quantized optimal control of discrete-time systems
In this paper we consider a quantized discrete-time linear quadratic regulator (DLQR) problem, namely a DLQR problem where the input u may only take values in a given finite set ...
Daniele Corona, Alessandro Giua, Carla Seatzu
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
15 years 10 months ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...