Sciweavers

2109 search results - page 218 / 422
» Solving Necklace Constraint Problems
Sort
View
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
15 years 3 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
CP
2009
Springer
16 years 29 days ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
ECML
2006
Springer
15 years 9 months ago
Subspace Metric Ensembles for Semi-supervised Clustering of High Dimensional Data
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
Bojun Yan, Carlotta Domeniconi
CONSTRAINTS
2008
78views more  CONSTRAINTS 2008»
15 years 6 months ago
Boosting Haplotype Inference with Local Search
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...
Inês Lynce, João Marques-Silva, Steve...
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 6 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang