Sciweavers

1717 search results - page 162 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
ASPDAC
2009
ACM
155views Hardware» more  ASPDAC 2009»
16 years 1 months ago
Variation-aware resource sharing and binding in behavioral synthesis
— As technology scales, the delay uncertainty caused by process variations has become increasingly pronounced in deep submicron designs. In the presence of process variations, wo...
Feng Wang 0004, Yuan Xie, Andres Takach
AAAI
2008
15 years 8 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
CORR
2010
Springer
174views Education» more  CORR 2010»
15 years 6 months ago
Hybrid Numerical Solution of the Chemical Master Equation
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the ...
Thomas A. Henzinger, Maria Mateescu, Linar Mikeev,...
ICALP
1993
Springer
15 years 10 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
INFOCOM
2009
IEEE
16 years 1 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao