1933 search results - page 112 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
116
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
130
click to vote
ALENEX
2009
15 years 1 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
112
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
In order to handle classification problems with real-valued attributes using discretization algorithms it is necessary to obtain a good and reduced set of cut points in order to l...
115
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
148
click to vote
GCC
2003
Springer
15 years 9 months ago
2003
Springer
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...