Sciweavers

706 search results - page 76 / 142
» Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Sort
View
TON
2008
99views more  TON 2008»
13 years 8 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
14 years 6 days ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
HCI
2007
13 years 10 months ago
FPF-SB : A Scalable Algorithm for Microarray Gene Expression Data Clustering
Efficient and effective analysis of large datasets from microarray gene expression data is one of the keys to time-critical personalized medicine. The issue we address here is the ...
Filippo Geraci, Mauro Leoncini, Manuela Montangero...
VLSISP
2002
139views more  VLSISP 2002»
13 years 8 months ago
A Modified Minimum Classification Error (MCE) Training Algorithm for Dimensionality Reduction
Dimensionality reduction is an important problem in pattern recognition. There is a tendency of using more and more features to improve the performance of classifiers. However, not...
Xuechuan Wang, Kuldip K. Paliwal
CODES
2008
IEEE
13 years 10 months ago
Software optimization for MPSoC: a mpeg-2 decoder case study
Using traditional software profiling to optimize embedded software in an MPSoC design is not reliable. With multiple processors running concurrently and programs interacting, trad...
Eric Cheung, Harry Hsieh, Felice Balarin