Sciweavers

235 search results - page 24 / 47
» An empirical study into class testability
Sort
View
ICDM
2009
IEEE
142views Data Mining» more  ICDM 2009»
13 years 7 months ago
Building Classifiers with Independency Constraints
In this paper we study the problem of classifier learning where the input data contains unjustified dependencies between some data attributes and the class label. Such cases arise...
Toon Calders, Faisal Kamiran, Mykola Pechenizkiy
CP
2006
Springer
14 years 1 months ago
Failure Analysis in Backtrack Search for Constraint Satisfaction
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Tudor Hulubei, Barry O'Sullivan
INFOCOM
2008
IEEE
14 years 4 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff
CEC
2007
IEEE
14 years 4 months ago
A Memetic Algorithm for test data generation of Object-Oriented software
— Generating test data for Object-Oriented (OO) software is a hard task. Little work has been done on the subject, and a lot of open problems still need to be investigated. In th...
Andrea Arcuri, Xin Yao
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 9 months ago
Optimization and Convergence of Observation Channels in Stochastic Control
This paper studies the optimization of observation channels (stochastic kernels) in partially observed stochastic control problems. In particular, existence, continuity, and convex...
Serdar Yüksel, Tamás Linder