Sciweavers

422 search results - page 68 / 85
» Multithreaded SAT Solving
Sort
View
WEA
2005
Springer
105views Algorithms» more  WEA 2005»
14 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...
ATAL
2003
Springer
14 years 3 months ago
Agent network topology and complexity
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
Xiaolong Jin, Jiming Liu
CAV
2003
Springer
107views Hardware» more  CAV 2003»
14 years 3 months ago
Theorem Proving Using Lazy Proof Explication
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
Cormac Flanagan, Rajeev Joshi, Xinming Ou, James B...
GLVLSI
2002
IEEE
105views VLSI» more  GLVLSI 2002»
14 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, ...
CSR
2010
Springer
14 years 2 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning