Sciweavers

3096 search results - page 41 / 620
» The Generalized FITC Approximation
Sort
View
TRS
2008
13 years 8 months ago
Local and Global Approximations for Incomplete Data
Abstract. For completely specified decision tables lower and upper approximations are unique, the lower approximation is the largest definable set contained in the approximated set...
Jerzy W. Grzymala-Busse, Wojciech Rzasa
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
13 years 6 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes
JCSS
2007
85views more  JCSS 2007»
13 years 8 months ago
A general dimension for query learning
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
José L. Balcázar, Jorge Castro, Davi...
HICSS
2003
IEEE
93views Biometrics» more  HICSS 2003»
14 years 1 months ago
A General Method for Statistical Performance Evaluation
In the paper, we propose a general method for statistical performance evaluation. The method incorporates various statistical metrics and automatically selects an appropriate stat...
Longzhuang Li, Yi Shang, Wei Zhang, Hongchi Shi
AAAI
2006
13 years 10 months ago
Functional Value Iteration for Decision-Theoretic Planning with General Utility Functions
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
Yaxin Liu, Sven Koenig