Sciweavers

122 search results - page 22 / 25
» A Short Cut to Optimal Sequences
Sort
View
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
15 years 2 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
104
Voted
CORR
2007
Springer
106views Education» more  CORR 2007»
14 years 9 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
EUROGP
2005
Springer
15 years 3 months ago
Evolving L-Systems to Capture Protein Structure Native Conformations
Abstract. A protein is a linear chain of amino acids that folds into a unique functional structure, called its native state. In this state, proteins show repeated substructures lik...
Gabi Escuela, Gabriela Ochoa, Natalio Krasnogor
ISMIR
2003
Springer
161views Music» more  ISMIR 2003»
15 years 2 months ago
Improving polyphonic and poly-instrumental music to score alignment
Music alignment links events in a score and points on the audio performance time axis. All the parts of a recording can be thus indexed according to score information. The automat...
Ferréol Soulez, Xavier Rodet, Diemo Schwarz
ECOOP
1995
Springer
15 years 1 months ago
Do Object-Oriented Languages Need Special Hardware Support?
Previous studies have shown that object-oriented programs have different execution characteristics than procedural programs, and that special object-oriented hardware can improve p...
Urs Hölzle, David Ungar