Sciweavers

2398 search results - page 327 / 480
» Constraint Programming and Graph Algorithms
Sort
View
JSAT
2006
88views more  JSAT 2006»
15 years 5 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva
176
Voted
PASTE
2010
ACM
15 years 10 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
ICSE
2008
IEEE-ACM
16 years 5 months ago
Systematically refactoring inheritance to delegation in java
Because of the strong coupling of classes and the proliferation of unneeded class members induced by inheritance, the suggestion to use composition and delegation instead has beco...
Hannes Kegel, Friedrich Steimann
144
Voted
DFT
2005
IEEE
83views VLSI» more  DFT 2005»
15 years 10 months ago
An ILP Formulation for Yield-driven Architectural Synthesis
Data flow graph dominant designs, such as communication video and audio applications, are common in today’s IC industry. In these designs, the datapath resources (e.g., adders,...
Zhaojun Wo, Israel Koren, Maciej J. Ciesielski
137
Voted
SC
1995
ACM
15 years 8 months ago
A Novel Approach Towards Automatic Data Distribution
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
Jordi Garcia, Eduard Ayguadé, Jesús ...