2136 search results - page 142 / 428 » Improving on Expectation Propagation |
122
Voted
PLDI
1993
ACM
15 years 4 months ago
1993
ACM
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...
CP
2004
Springer
15 years 4 months ago
2004
Springer
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...
104
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
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...
114
click to vote
ER
2006
Springer
15 years 4 months ago
2006
Springer
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...
118
Voted
ASPDAC
1995
ACM
15 years 4 months ago
1995
ACM
— 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...