Sciweavers

67 search results - page 6 / 14
» Succinct Representations of Arbitrary Graphs
Sort
View
EOR
2002
105views more  EOR 2002»
13 years 8 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler
SAT
2009
Springer
109views Hardware» more  SAT 2009»
14 years 3 months ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere
ENTCS
2006
142views more  ENTCS 2006»
13 years 8 months ago
Predicate Diagrams for the Verification of Real-Time Systems
We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed au...
Eun-Young Kang, Stephan Merz
BMCV
2000
Springer
14 years 1 months ago
Pose-Independent Object Representation by 2-D Views
We here describe a view-based system for the pose-independent representation of objects without making reference to 3-D models. Input to the system is a collection of pictures cov...
Jan Wieghardt, Christoph von der Malsburg
DATE
2009
IEEE
120views Hardware» more  DATE 2009»
14 years 3 months ago
Optimizing data flow graphs to minimize hardware implementation
Abstract - This paper describes an efficient graphbased method to optimize data-flow expressions for best hardware implementation. The method is based on factorization, common su...
Daniel Gomez-Prado, Q. Ren, Maciej J. Ciesielski, ...