Sciweavers

19130 search results - page 21 / 3826
» Modelling multi-path problems
Sort
View
CIE
2008
Springer
14 years 9 months ago
First-Order Model Checking Problems Parameterized by the Model
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
Barnaby Martin
4OR
2004
84views more  4OR 2004»
14 years 9 months ago
Non-classical preference models in combinatorial problems: Models and algorithms for graphs
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
Olivier Spanjaard
ICCAD
2009
IEEE
96views Hardware» more  ICCAD 2009»
14 years 7 months ago
PSTA-based branch and bound approach to the silicon speedpath isolation problem
The lack of good "correlation" between pre-silicon simulated delays and measured delays on silicon (silicon data) has spurred efforts on so-called silicon debug. The ide...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
FUIN
2010
141views more  FUIN 2010»
14 years 7 months ago
Decidability Problems in Petri Nets with Names and Replication
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
Fernando Rosa Velardo, David de Frutos-Escrig
MODELS
2009
Springer
15 years 2 months ago
CSP(M): Constraint Satisfaction Problem over Models
Ákos Horváth, Dániel Varr&oac...