Sciweavers

3678 search results - page 476 / 736
» On the Stable Paths Problem
Sort
View
COLOGNETWENTE
2009
15 years 6 months ago
Colored Trees in Edge-Colored Graphs
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 6 months ago
Behavior-based speciation for evolutionary robotics
This paper describes a speciation method that allows an evolutionary process to learn several robot behaviors using a single execution. Species are created in behavioral space in ...
Leonardo Trujillo, Gustavo Olague, Evelyne Lutton,...
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 5 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
115
Voted
ENDM
2007
68views more  ENDM 2007»
15 years 5 months ago
Detecting induced subgraphs
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
Benjamin Lévêque, David Y. Lin, Fr&ea...
SIAMAM
2008
91views more  SIAMAM 2008»
15 years 5 months ago
A Fluid Dynamic Model for Telecommunication Networks with Sources and Destinations
This paper proposes a macroscopic fluid dynamic model dealing with the flows of information on a telecommunication network with sources and destinations. The model consists of a co...
Ciro D'Apice, Rosanna Manzo, Benedetto Piccoli