4131 search results - page 54 / 827 » The Generalized Max-Controlled Set Problem |
99
Voted
TNN
2008
15 years 2 months ago
2008
In this paper, we argue that for a C-class classification problem, C 2-class classifiers, each of which discriminating one class from the other classes and having a characteristic ...
IPL
2006
15 years 2 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
115
Voted
IJCAI
2003
15 years 4 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
98
Voted
DAC
2010
ACM
15 years 6 months ago
2010
ACM
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...
CPM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...