Sciweavers

3318 search results - page 369 / 664
» The Weak Instance Model
Sort
View
DATE
1999
IEEE
194views Hardware» more  DATE 1999»
15 years 9 months ago
Algorithms for Solving Boolean Satisfiability in Combinational Circuits
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
Luís Guerra e Silva, Luis Miguel Silveira, ...
160
Voted
CODES
1998
IEEE
15 years 9 months ago
The construction of a retargetable simulator for an architecture template
Systems in the domain of high-performance video signal processing are becoming more and more programmable. We suggest an approach to design such systems that involves measuring, v...
Bart Kienhuis, Ed F. Deprettere, Kees A. Vissers, ...
152
Voted
ESOP
1998
Springer
15 years 8 months ago
Mode-Automata: About Modes and States for Reactive Systems
Abstract. In the eld of reactive system programming, data ow synchronous languages like Lustre BCH+85,CHPP87 or Signal GBBG85 o er a syntax similar to block-diagrams, and can be e ...
Florence Maraninchi, Yann Rémond
121
Voted
GECCO
2006
Springer
168views Optimization» more  GECCO 2006»
15 years 8 months ago
3D airspace sectoring by evolutionary computation: real-world applications
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...
Daniel Delahaye, Stephane Puechmorel
AMAI
2000
Springer
15 years 8 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva