3495 search results - page 7 / 699 » On the random satisfiable process |
TAINN
2005
Springer
14 years 3 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
MDM
2009
Springer
14 years 4 months ago
2009
Springer
Abstract—Flash disks have been an emerging secondary storage media. In particular, there have been portable devices, multimedia players and laptop computers that are configured ...
ENTCS
2010
13 years 9 months ago
2010
We report on the implementation and experimental analysis of an incremental multi-pass tableau-based procedure `a la Wolper for testing satisfiability in the linear time temporal ...
TACAS
2007
Springer
14 years 3 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
BC
2002
13 years 9 months ago
2002
We consider a spatial neuron model in which the membrane potential satisfies a linear cable equation with an input current which is a dynamical random process of the Ornstein