Sciweavers

866 search results - page 94 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
COCOON
2006
Springer
14 years 1 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
13 years 11 months ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf
ACTAC
2007
69views more  ACTAC 2007»
13 years 9 months ago
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
Dávid Hanák, Nagarajan Kandasamy
AISS
2010
161views more  AISS 2010»
13 years 6 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
CIVR
2007
Springer
178views Image Analysis» more  CIVR 2007»
14 years 3 months ago
Layout indexing of trademark images
Ensuring the uniqueness of trademark images and protecting their identities are the most important objectives for the trademark registration process. To prevent trademark infringe...
Reinier H. van Leuken, M. Fatih Demirci, Victoria ...