Sciweavers

7092 search results - page 599 / 1419
» Parallelizing constraint programs
Sort
View
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
15 years 10 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
ISQED
2010
IEEE
123views Hardware» more  ISQED 2010»
15 years 7 months ago
Yield-constrained digital circuit sizing via sequential geometric programming
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
Yu Ben, Laurent El Ghaoui, Kameshwar Poolla, Costa...
208
Voted
CCE
2008
15 years 5 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
121
Voted
EOR
2006
74views more  EOR 2006»
15 years 5 months ago
A mixed-integer programming approach to multi-class data classification problem
This paper presents a new data classification method based on mixed-integer programming. Traditional approaches that are based on partitioning the data sets into two groups perfor...
Fadime Üney Yüksektepe, Metin Türka...
148
Voted
JMLR
2006
125views more  JMLR 2006»
15 years 5 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss