Sciweavers

219 search results - page 25 / 44
» Requirement error abstraction and classification: an empiric...
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 6 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
CLEIEJ
2002
113views more  CLEIEJ 2002»
14 years 11 months ago
The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...
Marco T. Morazán, Douglas R. Troeger, Myles...
CORR
2011
Springer
183views Education» more  CORR 2011»
14 years 3 months ago
Learning When Training Data are Costly: The Effect of Class Distribution on Tree Induction
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
Foster J. Provost, Gary M. Weiss
JIFS
2008
155views more  JIFS 2008»
14 years 11 months ago
Improving supervised learning performance by using fuzzy clustering method to select training data
The crucial issue in many classification applications is how to achieve the best possible classifier with a limited number of labeled data for training. Training data selection is ...
Donghai Guan, Weiwei Yuan, Young-Koo Lee, Andrey G...
ICMCS
2007
IEEE
117views Multimedia» more  ICMCS 2007»
15 years 5 months ago
Digital Media Indexing on the Cell Processor
We present a case study of developing a digital media indexing application, code-named MARVEL, on the STI Cell Broadband Engine (CBE) processor. There are two aspects of the targe...
Lurng-Kuo Liu, Qiang Liu, Apostol Natsev, Kenneth ...