Sciweavers

154 search results - page 10 / 31
» Optimization problems in multiple subtree graphs
Sort
View
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
15 years 3 months ago
On the constructiveness of context-aware crossover
Crossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently ...
Hammad Majeed, Conor Ryan
81
Voted
WOB
2004
14 years 10 months ago
A Multi-Neighbor-Joining Approach for Phylogenetic Tree Reconstruction and Visualization
ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by a...
Ana Estela Antunes da Silva, Wilfredo J. Puma-Vill...
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
15 years 4 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
CVPR
2008
IEEE
15 years 11 months ago
Interactive image matting for multiple layers
Image matting deals with finding the probability that each pixel in an image belongs to a user specified `object' or to the remaining `background'. Most existing methods...
Dheeraj Singaraju, René Vidal
118
Voted
TASE
2010
IEEE
14 years 4 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen