Sciweavers

2136 search results - page 142 / 428
» Improving on Expectation Propagation
Sort
View
PLDI
1993
ACM
15 years 10 months ago
Dependence-Based Program Analysis
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
Richard Johnson, Keshav Pingali
CP
2004
Springer
15 years 10 months ago
Full Dynamic Substitutability by SAT Encoding
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
Steven David Prestwich
CP
2006
Springer
15 years 10 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
ER
2006
Springer
116views Database» more  ER 2006»
15 years 10 months ago
Quality-Driven Automatic Transformation of Object-Oriented Navigational Models
Abstract. Navigability is a main concern in the design of Web applications. In order to assess such navigability a number of measures has been proposed. From them, measures defined...
Cristina Cachero, Marcela Genero, Coral Calero, Sa...
ASPDAC
1995
ACM
108views Hardware» more  ASPDAC 1995»
15 years 10 months ago
Transistor reordering rules for power reduction in CMOS gates
— The goal of transistor reordering for a logic gate is to reduce the propagation delay as well as the charging and discharging of internal capacitances to achieve low power cons...
Wen-Zen Shen, Jiing-Yuan Lin, Fong-Wen Wang