Sciweavers

1003 search results - page 86 / 201
» Type Inference with Inequalities
Sort
View
AIPS
2008
15 years 6 months ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell
WSC
2007
15 years 6 months ago
Rare-event simulation for a multidimensional random walk with t distributed increments
We consider the problem of efficient estimation of first passage time probabilities for a multidimensional random walk with t distributed increments, via simulation. In addition...
Jose H. Blanchet, Jingchen Liu
133
Voted
NIPS
2008
15 years 5 months ago
Fast Rates for Regularized Objectives
We study convergence properties of empirical minimization of a stochastic strongly convex objective, where the stochastic component is linear. We show that the value attained by t...
Karthik Sridharan, Shai Shalev-Shwartz, Nathan Sre...
MP
2006
123views more  MP 2006»
15 years 4 months ago
New interval methods for constrained global optimization
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
Mihály Csaba Markót, J. Ferná...
SIAMAM
2000
89views more  SIAMAM 2000»
15 years 3 months ago
An Efficient Numerical Algorithm for Cracks Partly in Frictionless Contact
An algorithm for a loaded crack partly in frictionless contact is presented. The problem is nonlinear in the sense that the equations of linear elasticity are supplemented by certa...
Gunnar Peters, Johan Helsing