Sciweavers

4320 search results - page 633 / 864
» Functional Objects
Sort
View
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 10 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 10 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
ICPR
2010
IEEE
15 years 9 months ago
Temporal Extension of Laplacian Eigenmaps for Unsupervised Dimensionality Reduction of Time Series
—A novel non-linear dimensionality reduction method, called Temporal Laplacian Eigenmaps, is introduced to process efficiently time series data. In this embedded-based approach,...
Michal Lewandowski, Jesus Martinez-Del-Rincon, Dim...
AAAI
2007
15 years 8 months ago
Acquiring Visibly Intelligent Behavior with Example-Guided Neuroevolution
Much of artificial intelligence research is focused on devising optimal solutions for challenging and well-defined but highly constrained problems. However, as we begin creating...
Bobby D. Bryant, Risto Miikkulainen
WSC
2007
15 years 8 months ago
Optimal scheduling of probabilistic repetitive projects using completed unit and genetic algorithms
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
Chachrist Srisuwanrat, Photios G. Ioannou