Sciweavers

1529 search results - page 83 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
ICCAD
2004
IEEE
147views Hardware» more  ICCAD 2004»
16 years 25 days ago
Interval-valued reduced order statistical interconnect modeling
9, IO]. However, unlike the case with static timing, it is not so easy We show how recent advances in the handling of correlated interval representations of range uncertainty can b...
James D. Ma, Rob A. Rutenbar
123
Voted
GECCO
2004
Springer
15 years 9 months ago
On the Strength of Size Limits in Linear Genetic Programming
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
Nicholas Freitag McPhee, Alex Jarvis, Ellery Fusse...
GECCO
2006
Springer
177views Optimization» more  GECCO 2006»
15 years 7 months ago
Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure
The learning classifier system XCS is an iterative rulelearning system that evolves rule structures based on gradient-based prediction and rule quality estimates. Besides classifi...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
BMCBI
2008
148views more  BMCBI 2008»
15 years 4 months ago
Discovering biclusters in gene expression data based on high-dimensional linear geometries
Background: In DNA microarray experiments, discovering groups of genes that share similar transcriptional characteristics is instrumental in functional annotation, tissue classifi...
Xiangchao Gan, Alan Wee-Chung Liew, Hong Yan
135
Voted
CPAIOR
2010
Springer
15 years 8 months ago
A Constraint Programming Approach for the Service Consolidation Problem
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...
Kanika Dhyani, Stefano Gualandi, Paolo Cremonesi