Sciweavers

610 search results - page 94 / 122
» Using SAT in QBF
Sort
View
DATE
2005
IEEE
176views Hardware» more  DATE 2005»
15 years 3 months ago
Effective Lower Bounding Techniques for Pseudo-Boolean Optimization
Linear Pseudo-Boolean Optimization (PBO) is a widely used modeling framework in Electronic Design Automation (EDA). Due to significant advances in Boolean Satisfiability (SAT), ...
Vasco M. Manquinho, João P. Marques Silva
57
Voted
WEA
2005
Springer
105views Algorithms» more  WEA 2005»
15 years 3 months ago
Inferring AS Relationships: Dead End or Lively Beginning?
Recent techniques for inferring business relationships between ASs [3, 8] have yielded maps that have extremely few invalid BGP paths in the terminology of Gao [9]. However, some ...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, B...
91
Voted
ICTAC
2004
Springer
15 years 2 months ago
Replicative - Distribution Rules in P Systems with Active Membranes
Abstract. P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the ...
Tseren-Onolt Ishdorj, Mihai Ionescu
79
Voted
GLVLSI
2002
IEEE
105views VLSI» more  GLVLSI 2002»
15 years 2 months ago
Board-level multiterminal net assignment
The paper presents a satisfiability-based method for solving the board-level multiterminal net routing problem in Clos-Folded FPGA based logic emulation systems. The approach tran...
Xiaoyu Song, William N. N. Hung, Alan Mishchenko, ...
SIGSOFT
2000
ACM
15 years 1 months ago
Automating first-order relational logic
An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a mode...
Daniel Jackson