753 search results - page 35 / 151 » Completing a (k - 1)-Assignment |
145
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
151
click to vote
ICPP
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper compares three similar loop-grouping methods. All methods are based on projecting the n-dimensional iteration space Jn onto a k-dimensional one, called the projected sp...
178
click to vote
COCOON
2000
Springer
15 years 10 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
160
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
We present efficient sensitivity-analysis algorithms for two problems involving Markov models of sequence evolution: ancestral reconstruction in evolutionary trees and local ungap...
144
click to vote
WCE
2007
15 years 7 months ago
2007
Abstract—The development of the transformer insulation failure undergoes three stages: insulation aging, incipient faults and a short circuit. This paper presents a complete sche...