Sciweavers

935 search results - page 139 / 187
» A New Statistical Optimization Algorithm for Gate Sizing
Sort
View
121
Voted
BMCBI
2008
128views more  BMCBI 2008»
15 years 2 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
100
Voted
ICALP
2005
Springer
15 years 8 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
ATAL
2009
Springer
15 years 9 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...
JMLR
2010
148views more  JMLR 2010»
14 years 9 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
IPPS
2010
IEEE
15 years 13 days ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé