Sciweavers

154 search results - page 2 / 31
» Optimization problems in multiple subtree graphs
Sort
View
EMMCVPR
2001
Springer
13 years 9 months ago
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Marcello Pelillo
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
13 years 9 months ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 7 days ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
ISCAS
2005
IEEE
147views Hardware» more  ISCAS 2005»
13 years 10 months ago
A heuristic approach for multiple restricted multiplication
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
Nalin Sidahao, George A. Constantinides, Peter Y. ...
CEC
2008
IEEE
13 years 11 months ago
Path optimization for multiple objectives in directed graphs using genetic algorithms
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
Juan Rada, Ruben Parma, Wilmer Pereira