Sciweavers

38 search results - page 7 / 8
» Representation in stochastic search for phylogenetic tree re...
Sort
View
GRAPHICSINTERFACE
1997
14 years 5 days ago
A Heuristic Method for Generating 2D CSG Trees from Bitmaps
This paper presents a method for generating compact and effective constructive-solid-geometry (CSG) object representations from 2D bitmap representations. The method consists of t...
Sarah F. Frisken Gibson, Joe Marks, Danielle Feinb...
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
14 years 4 months ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...
CG
2006
Springer
14 years 24 days ago
Feature Construction for Reinforcement Learning in Hearts
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
Nathan R. Sturtevant, Adam M. White
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
13 years 12 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen
BMCBI
2008
96views more  BMCBI 2008»
13 years 11 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown