Sciweavers

500 search results - page 32 / 100
» A Sample Approximation Approach for Optimization with Probab...
Sort
View
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
14 years 2 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
AIPS
2006
13 years 9 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
KDD
2010
ACM
259views Data Mining» more  KDD 2010»
13 years 12 months ago
A probabilistic model for personalized tag prediction
Social tagging systems have become increasingly popular for sharing and organizing web resources. Tag recommendation is a common feature of social tagging systems. Social tagging ...
Dawei Yin, Zhenzhen Xue, Liangjie Hong, Brian D. D...
ICRA
2003
IEEE
222views Robotics» more  ICRA 2003»
14 years 1 months ago
Path planning using learned constraints and preferences
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...
Gregory Dudek, Saul Simhon
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
14 years 2 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das