1933 search results - page 107 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
161
click to vote
DATE
2000
IEEE
15 years 10 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
159
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
187
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
219
click to vote
ECRTS
2005
IEEE
15 years 12 months ago
2005
IEEE
Multiprocessor hardware platforms are now being considered for embedded systems, due to their high computational power and little additional cost when compared to single processor...
168
click to vote
NECO
2006
15 years 6 months ago
2006
The application of boosting technique to the regression problems has received relatively little attention in contrast to the research aimed at classification problems. This paper ...