Sciweavers

1188 search results - page 74 / 238
» Extended Graph Unification
Sort
View
98
Voted
CEC
2008
IEEE
15 years 7 months ago
Analysis of population-based evolutionary algorithms for the vertex cover problem
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
Pietro Simone Oliveto, Jun He, Xin Yao
AB
2007
Springer
15 years 7 months ago
Relating Attractors and Singular Steady States in the Logical Analysis of Bioregulatory Networks
Abstract. In 1973 R. Thomas introduced a logical approach to modeling and analysis of bioregulatory networks. Given a set of Boolean functions describing the regulatory interaction...
Heike Siebert, Alexander Bockmayr
102
Voted
ICCAD
1998
IEEE
80views Hardware» more  ICCAD 1998»
15 years 5 months ago
On the optimization power of retiming and resynthesis transformations
Retiming and resynthesis transformations can be used for optimizing the area, power, and delay of sequential circuits. Even though this technique has been known for more than a de...
Rajeev K. Ranjan, Vigyan Singhal, Fabio Somenzi, R...
104
Voted
ML
2008
ACM
146views Machine Learning» more  ML 2008»
15 years 22 days ago
Improving maximum margin matrix factorization
Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful lear...
Markus Weimer, Alexandros Karatzoglou, Alex J. Smo...
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 3 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...