Sciweavers

8413 search results - page 66 / 1683
» Ordering Problem Subgoals
Sort
View
ASE
2004
167views more  ASE 2004»
13 years 7 months ago
Cluster-Based Partial-Order Reduction
The verification of concurrent systems through an exhaustive traversal of the state space suffers from the infamous state-space-explosion problem, caused by the many interleavings ...
Twan Basten, Dragan Bosnacki, Marc Geilen
ICFCA
2010
Springer
14 years 2 months ago
Hardness of Enumerating Pseudo-intents in the Lectic Order
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
Felix Distel
JDA
2007
83views more  JDA 2007»
13 years 8 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
SCL
2010
97views more  SCL 2010»
13 years 6 months ago
Krylov subspace methods for model order reduction of bilinear control systems
We discuss the use of Krylov subspace methods with regard to the problem of model order reduction. The focus lies on bilinear control systems, a special class of nonlinear systems...
Tobias Breiten, Tobias Damm
ICCD
2001
IEEE
176views Hardware» more  ICCD 2001»
14 years 4 months ago
BDD Variable Ordering by Scatter Search
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
William N. N. Hung, Xiaoyu Song