Sciweavers

1208 search results - page 41 / 242
» Uniform eventown problems
Sort
View
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 3 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
14 years 6 months ago
PD+ attitude control of rigid bodies with improved performance
Abstract-- We address the problem of state feedback attitude control of a rigid body in quaternion coordinate space through a modified PD+ tracking controller. The control law ensu...
Rune Schlanbusch, Antonio Loría, Raymond Kr...
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
16 years 1 days ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 11 months ago
Online Algorithms for the Multi-Armed Bandit Problem with Markovian Rewards
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
Cem Tekin, Mingyan Liu
COGSCI
2006
75views more  COGSCI 2006»
14 years 11 months ago
A Hierarchical Bayesian Model of Human Decision-Making on an Optimal Stopping Problem
We consider human performance on an optimal stopping problem where people are presented with a list of numbers independently chosen from a uniform distribution. People are told ho...
Michael D. Lee