1933 search results - page 163 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
117
Voted
DAC
1995
ACM
15 years 7 months ago
1995
ACM
Abstract—We present a new approach to event-driven simulation that does not use a centralized run-time event queue, yet is capable of handling arbitrary models, including those w...
150
click to vote
AINA
2006
IEEE
15 years 10 months ago
2006
IEEE
Multiple sequence alignment is an important and difficult problem in molecular biology and bioinformatics. In this paper, we propose a partitioning approach that significantly impr...
135
click to vote
AAAI
2006
15 years 5 months ago
2006
Despite the significant progress to extend Markov Decision Processes (MDP) to cooperative multi-agent systems, developing approaches that can deal with realistic problems remains ...
153
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
AdaBoost.OC has shown to be an effective method in boosting "weak" binary classifiers for multi-class learning. It employs the Error Correcting Output Code (ECOC) method...
135
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...