4860 search results - page 338 / 972 » SNPs Problems, Complexity, and Algorithms |
133
Voted
SCHEDULING
2010
15 years 1 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...
138
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
114
click to vote
IPL
2010
15 years 1 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...
106
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...
128
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...