Sciweavers

1933 search results - page 127 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
CPAIOR
2010
Springer
15 years 2 months ago
Boosting Set Constraint Propagation for Network Design
Abstract. This paper reconsiders the deployment of synchronous optical networks (SONET), an optimization problem naturally expressed in terms of set variables. Earlier approaches, ...
Justin Yip, Pascal Van Hentenryck, Carmen Gervet
139
Voted
HIPC
2009
Springer
15 years 1 months ago
Optimizing the use of GPU memory in applications with large data sets
Abstract--With General Purpose programmable GPUs becoming more and more popular, automated tools are needed to bridge the gap between achievable performance from highly parallel ar...
Nadathur Satish, Narayanan Sundaram, Kurt Keutzer
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
15 years 10 months ago
Modeling XCS in class imbalances: population size and parameter settings
This paper analyzes the scalability of the population size required in XCS to maintain niches that are infrequently activated. Facetwise models have been developed to predict the ...
Albert Orriols-Puig, David E. Goldberg, Kumara Sas...
WABI
2007
Springer
15 years 10 months ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...
TSP
2008
151views more  TSP 2008»
15 years 3 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar