248 search results - page 30 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
MP
2007
14 years 11 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
This paper introduces a novel genetic algorithm strategy based on the reuse of chromosomes from previous generations in the creation of offspring individuals. A number of chromoso...
109
Voted
JSAC
2010
14 years 10 months ago
2010
We consider the problem of coordinating a group of mobile nodes communicating through a wireless medium. The objective of the network is the alignment of all the nodes towards a c...
140
click to vote
ICCV
1999
IEEE
16 years 26 days ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
108
click to vote
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...