1933 search results - page 101 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
116
Voted
ICML
2004
IEEE
15 years 9 months ago
2004
IEEE
We consider the problem of eliminating redundant Boolean features for a given data set, where a feature is redundant if it separates the classes less well than another feature or ...
141
Voted
AI
2001
Springer
15 years 8 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
143
Voted
WG
2007
Springer
15 years 9 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
125
Voted
FLAIRS
2007
15 years 6 months ago
2007
Many real-world domains present the problem of imbalanced data sets, where examples of one classes significantly outnumber examples of other classes. This makes learning difficu...
142
Voted
TEC
2010
14 years 10 months ago
2010
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle t...