Sciweavers

372 search results - page 9 / 75
» A Study of The Fragile Base Class Problem
Sort
View
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
14 years 7 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
JSAT
2008
122views more  JSAT 2008»
14 years 9 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
CORR
2011
Springer
183views Education» more  CORR 2011»
14 years 1 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
ICIP
2004
IEEE
15 years 11 months ago
Regularization studies on LDA for face recognition
It is well-known that the applicability of Linear Discriminant Analysis (LDA) to high-dimensional pattern classification tasks such as face recognition (FR) often suffers from the...
Juwei Lu, Konstantinos N. Plataniotis, Anastasios ...
LREC
2010
206views Education» more  LREC 2010»
14 years 11 months ago
Efficient Multilabel Classification Algorithms for Large-Scale Problems in the Legal Domain
In this paper we evaluate the performance of multilabel classification algorithms on the EUR-Lex database of legal documents of the European Union. On the same set of underlying d...
Eneldo Loza Mencía, Johannes Fürnkranz