Sciweavers

193 search results - page 21 / 39
» sat 2007
Sort
View
SIGSOFT
2007
ACM
15 years 10 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
JACM
2007
79views more  JACM 2007»
14 years 9 months ago
A new look at survey propagation and its generalizations
This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effe...
Elitza N. Maneva, Elchanan Mossel, Martin J. Wainw...
ICCAD
2007
IEEE
102views Hardware» more  ICCAD 2007»
15 years 6 months ago
Scalable exploration of functional dependency by interpolation and incremental SAT solving
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
Chih-Chun Lee, Jie-Hong Roland Jiang, Chung-Yang H...
124
Voted
IGARSS
2010
14 years 4 months ago
Enhanced Cloud algorithm from collocated CALIPSO, CloudSat and MODIS global boundary layer lapse rate studies
Coincident profile information from CALIPSO's lidar and CloudSat's radar offers a unique opportunity to map the vertical structure of clouds over the globe with accuraci...
Sunny Sun-Mack, Patrick Minnis, Seiji Kato, Yan Ch...
JCM
2007
131views more  JCM 2007»
14 years 9 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze