Sciweavers

8413 search results - page 1097 / 1683
» Ordering Problem Subgoals
Sort
View
GECCO
2008
Springer
163views Optimization» more  GECCO 2008»
15 years 8 months ago
Embedded evolutionary multi-objective optimization for worst case robustness
In Multi-Objective Problems (MOPs) involving uncertainty, each solution might be associated with a cluster of performances in the objective space depending on the possible scenari...
Gideon Avigad, Jürgen Branke
ICML
2010
IEEE
15 years 8 months ago
Inverse Optimal Control with Linearly-Solvable MDPs
We present new algorithms for inverse optimal control (or inverse reinforcement learning, IRL) within the framework of linearlysolvable MDPs (LMDPs). Unlike most prior IRL algorit...
Dvijotham Krishnamurthy, Emanuel Todorov
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 7 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang
BMCBI
2010
86views more  BMCBI 2010»
15 years 7 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
BMCBI
2007
154views more  BMCBI 2007»
15 years 7 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
« Prev « First page 1097 / 1683 Last » Next »