Sciweavers

77 search results - page 8 / 16
» Mutation Selection: Some Could be Better than All
Sort
View
COMCOM
2006
80views more  COMCOM 2006»
15 years 1 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...
132
Voted
FSTTCS
2004
Springer
15 years 7 months 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
110
Voted
SPLC
2010
15 years 5 days ago
Improving the Testing and Testability of Software Product Lines
Abstract. Software Product Line (SPL) engineering offers several advantages in the development of families of software products. There is still a need, however, for better underst...
Isis Cabral, Myra B. Cohen, Gregg Rothermel
JMLR
2011
117views more  JMLR 2011»
14 years 8 months ago
Parameter Screening and Optimisation for ILP using Designed Experiments
Reports of experiments conducted with an Inductive Logic Programming system rarely describe how specific values of parameters of the system are arrived at when constructing model...
Ashwin Srinivasan, Ganesh Ramakrishnan
113
Voted
INFOCOM
2011
IEEE
14 years 5 months ago
Optimal sampling algorithms for frequency estimation in distributed data
—Consider a distributed system with n nodes where each node holds a multiset of items. In this paper, we design sampling algorithms that allow us to estimate the global frequency...
Zengfeng Huang, Ke Yi, Yunhao Liu, Guihai Chen