Sciweavers

4695 search results - page 612 / 939
» Software Clustering Techniques and the Use of Combined Algor...
Sort
View
CAV
2008
Springer
125views Hardware» more  CAV 2008»
15 years 9 months ago
A Practical Approach to Word Level Model Checking of Industrial Netlists
In this paper we present a word-level model checking method that attempts to speed up safety property checking of industrial netlists. Our aim is to construct an algorithm that all...
Per Bjesse
193
Voted
IJCAI
2001
15 years 9 months ago
Planning as Model Checking for Extended Goals in Non-deterministic Domains
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal proper...
Marco Pistore, Paolo Traverso
UAI
2000
15 years 8 months ago
Probabilistic State-Dependent Grammars for Plan Recognition
Techniques for plan recognition under uncertainty require a stochastic model of the plangeneration process. We introduce probabilistic state-dependent grammars (PSDGs) to represen...
David V. Pynadath, Michael P. Wellman
EOR
2006
134views more  EOR 2006»
15 years 7 months ago
A smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
Jean-Pierre Dussault, Patrice Marcotte, Séb...
204
Voted
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 7 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof