1933 search results - page 164 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
147
Voted
GD
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
128
Voted
TOMACS
2010
14 years 11 months ago
2010
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
122
Voted
SODA
2001
ACM
15 years 5 months ago
2001
ACM
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
163
click to vote
ICCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
153
click to vote
FTTCS
2006
15 years 4 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...