Sciweavers

312 search results - page 47 / 63
» Iterative compression and exact algorithms
Sort
View
ICML
2004
IEEE
14 years 10 months ago
Apprenticeship learning via inverse reinforcement learning
We consider learning in a Markov decision process where we are not explicitly given a reward function, but where instead we can observe an expert demonstrating the task that we wa...
Pieter Abbeel, Andrew Y. Ng
ACSC
2007
IEEE
14 years 4 months ago
Compact Layout of Layered Trees
The standard layered drawing convention for trees in which the vertical placement of a node is given by its level in the tree and each node is centered between its children can le...
Kim Marriott, Peter Sbarski
AI
2003
Springer
14 years 3 months ago
Stochastic Local Search for Multiprocessor Scheduling for Minimum Total Tardiness
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
Michael Pavlin, Holger H. Hoos, Thomas Stützl...
ICB
2007
Springer
183views Biometrics» more  ICB 2007»
13 years 11 months ago
Factorial Hidden Markov Models for Gait Recognition
Gait recognition is an effective approach for human identification at a distance. During the last decade, the theory of hidden Markov models (HMMs) has been used successfully in th...
Changhong Chen, Jimin Liang, Haihong Hu, Licheng J...
MP
2010
135views more  MP 2010»
13 years 8 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal