Sciweavers

1933 search results - page 141 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
15 years 9 months ago
A Sensitivity Analysis of a Cooperative Coevolutionary Algorithm Biased for Optimization
Abstract. Recent theoretical work helped explain certain optimizationrelated pathologies in cooperative coevolutionary algorithms (CCEAs). Such explanations have led to adopting sp...
Liviu Panait, R. Paul Wiegand, Sean Luke
169
Voted
ICCS
2005
Springer
15 years 9 months ago
Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks
Abstract. Replication of content on geographically distributed servers can improve both performance and reliability of the Web service. Anycast is a one-toone-of-many delivery tech...
Krzysztof Walkowiak
JCP
2008
121views more  JCP 2008»
15 years 4 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi
COR
2006
99views more  COR 2006»
15 years 4 months ago
Waste collection vehicle routing problem with time windows
In this paper, we address a real life waste collection vehicle routing problem with time windows (VRPTW) with consideration of multiple disposal trips and drivers' lunch brea...
Byung-In Kim, Seongbae Kim, Surya Sahoo
DAC
1999
ACM
16 years 5 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...