9842 search results - page 352 / 1969 » The Complexity of the Matching-Cut Problem |
133
click to vote
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Probl...
128
click to vote
TJS
2008
15 years 4 months ago
2008
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
119
click to vote
IPL
2010
15 years 2 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
141
click to vote
SCHEDULING
2010
15 years 2 months ago
2010
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formu...
140
click to vote
APWEB
2006
Springer
15 years 7 months ago
2006
Springer
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...