Sciweavers

5153 search results - page 738 / 1031
» Introduction to Randomized Algorithms
Sort
View
CEC
2010
IEEE
15 years 5 months ago
On the role of modularity in evolutionary dynamic optimisation
The field of evolutionary dynamic optimisation is concerned with the application of evolutionary algorithms to dynamic optimisation problems. In recent years, numerous new algorith...
Philipp Rohlfshagen, Xin Yao
SAC
2010
ACM
15 years 4 months ago
Chemotaxis-based sorting of self-organizing heterotypic agents
Cell sorting is a fundamental phenomenon in morphogenesis, which is the process that leads to shape formation in living organisms. The sorting of heterotypic cell populations is p...
Manolya Eyiyurekli, Linge Bai, Peter I. Lelkes, Da...
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
15 years 4 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
CORR
2010
Springer
174views Education» more  CORR 2010»
15 years 4 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,...
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 4 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg