Sciweavers

16093 search results - page 307 / 3219
» On the optimality of the neighbor-joining algorithm
Sort
View
DAC
2005
ACM
16 years 7 months ago
An efficient algorithm for statistical minimization of total power under timing yield constraints
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
Murari Mani, Anirudh Devgan, Michael Orshansky
SMC
2007
IEEE
102views Control Systems» more  SMC 2007»
16 years 1 months ago
An improved immune Q-learning algorithm
—Reinforcement learning is a framework in which an agent can learn behavior without knowledge on a task or an environment by exploration and exploitation. Striking a balance betw...
Zhengqiao Ji, Q. M. Jonathan Wu, Maher A. Sid-Ahme...
FSTTCS
2004
Springer
16 years 4 days ago
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
Gerold Jäger, Anand Srivastav
180
Voted
GECCO
2004
Springer
16 years 4 days ago
The Lens Design Using the CMA-ES Algorithm
This paper presents a lens system design algorithm using the covariance matrix adaptation evolution strategy (CMA-ES), which is one of the most powerful self-adaptation mechanisms....
Yuichi Nagata
146
Voted
JCSS
2008
96views more  JCSS 2008»
15 years 6 months ago
Precedence constrained scheduling in (2 - 7/(3p+1)) optimal
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
Devdatta Gangal, Abhiram G. Ranade