Sciweavers

2917 search results - page 141 / 584
» Satisfying Interaction Constraints
Sort
View
UAI
2008
13 years 11 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht
JCP
2008
104views more  JCP 2008»
13 years 10 months ago
Discovery of Sequential Patterns Coinciding with Analysts' Interests
This paper proposes a new sequential pattern mining method. The method introduces a new evaluation criterion satisfying the Apriori property. The criterion is calculated by the fre...
Shigeaki Sakurai, Youichi Kitahara, Ryohei Orihara...
COMPUTING
2004
115views more  COMPUTING 2004»
13 years 10 months ago
Length Preserving Multiresolution Editing of Curves
In this paper a method for multiresolution deformation of planar piecewise linear curves that preserves the curve length is presented. In a wavelet based multiresolution editing f...
Basile Sauvage, Stefanie Hahmann, Georges-Pierre B...
AIR
1999
90views more  AIR 1999»
13 years 9 months ago
A Survey of Automated Timetabling
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...
Andrea Schaerf
MP
1998
134views more  MP 1998»
13 years 9 months ago
Second-order global optimality conditions for convex composite optimization
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
Xiaoqi Yang