Sciweavers

3020 search results - page 223 / 604
» Optimal partition trees
Sort
View
TOG
2008
103views more  TOG 2008»
15 years 6 months ago
Sketch-based tree modeling using Markov random field
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
Xuejin Chen, Boris Neubert, Ying-Qing Xu, Oliver D...
BMCBI
2008
138views more  BMCBI 2008»
15 years 6 months ago
Automated simultaneous analysis phylogenetics (ASAP): an enabling tool for phlyogenomics
Background: The availability of sequences from whole genomes to reconstruct the tree of life has the potential to enable the development of phylogenomic hypotheses in ways that ha...
Indra Neil Sarkar, Mary G. Egan, Gloria M. Coruzzi...
ECAI
2004
Springer
16 years 16 hour ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
DAC
2004
ACM
16 years 7 months ago
An approach to placement-coupled logic replication
We present a set of techniques for placement-coupled, timingdriven logic replication. Two components are at the core of the approach. First is an algorithm for optimal timingdrive...
Milos Hrkic, John Lillis, Giancarlo Beraudo
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
16 years 9 hour ago
Evolving Better Multiple Sequence Alignments
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
Luke Sheneman, James A. Foster