Sciweavers

613 search results - page 13 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
APPML
2005
55views more  APPML 2005»
13 years 6 months ago
Recovering a phylogenetic tree using pairwise closure operations
A fundamental task in evolutionary biology is the amalgamation of a collection P of leaf-labelled trees into a single parent tree. A desirable feature of any such amalgamation is ...
Katharina T. Huber, Vincent Moulton, Charles Sempl...
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 1 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 26 days ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
DAC
1995
ACM
13 years 10 months ago
On the Bounded-Skew Clock and Steiner Routing Problems
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
Dennis J.-H. Huang, Andrew B. Kahng, Chung-Wen Alb...
EEE
2004
IEEE
13 years 10 months ago
Simulation Models and Their Metainfo-Management Using RDF-Based Paradigms
In a catalogue for computer-based models the basic problem is that complex interdependencies between models must be addressed, which are dependent on an application's domain....
Michael C. Jaeger, Moussa Lo, Robert J. Pefferly