Sciweavers

232 search results - page 35 / 47
» Randomized Kinodynamic Planning
Sort
View
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 5 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
CSCW
2012
ACM
12 years 5 months ago
Socializing volunteers in an online community: a field experiment
Although many off-line organizations give their employees training, mentorship, a cohort and other socialization experiences that improve their retention and productivity, online ...
Rosta Farzan, Robert Kraut, Aditya Pal, Joseph A. ...
SCAI
2008
13 years 11 months ago
Towards Automatic Model Generation by Optimization
The problem of automatically selecting simulation models for autonomous agents depending on their current intentions and beliefs is considered in this paper. The intended use of t...
Per Nyblom, Patrick Doherty
COR
2007
103views more  COR 2007»
13 years 9 months ago
A reactive GRASP and path relinking for a combined production-distribution problem
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
Mourad Boudia, Mohamed Aly Ould Louly, Christian P...
JCO
2007
123views more  JCO 2007»
13 years 9 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...