Sciweavers

952 search results - page 50 / 191
» Computational complexity of stochastic programming problems
Sort
View
PPDP
2010
Springer
14 years 10 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
110
Voted
COLT
2004
Springer
15 years 4 months ago
The Budgeted Multi-armed Bandit Problem
straction of the following scenarios: choosing from among a set of alternative treatments after a fixed number of clinical trials, determining the best parameter settings for a pro...
Omid Madani, Daniel J. Lizotte, Russell Greiner
97
Voted
BMCBI
2007
172views more  BMCBI 2007»
15 years 17 days ago
msBayes: Pipeline for testing comparative phylogeographic histories using hierarchical approximate Bayesian computation
Background: Although testing for simultaneous divergence (vicariance) across different population-pairs that span the same barrier to gene flow is of central importance to evoluti...
Michael J. Hickerson, Eli Stahl, Naoki Takebayashi
113
Voted
CONTEXT
2003
Springer
15 years 5 months ago
GRAVA: An Architecture Supporting Automatic Context Transitions and Its Application to Robust Computer Vision
We describe a software development approach for vision that enhances robustness by making novel use of context. Conventional approaches to most image understanding problems suffe...
Paul Robertson, Robert Laddaga
ECCC
2002
103views more  ECCC 2002»
15 years 8 days ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák