2450 search results - page 294 / 490 » Time Mapping with Hypergraphs |
58
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
138
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
132
Voted
DCG
2008
15 years 3 months ago
2008
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
133
Voted
DKE
2008
15 years 3 months ago
2008
The thematic and citation structures of Data and Knowledge Engineering (DKE) (1985-2007) are identified based on text analysis and citation analysis of the bibliographic records o...
130
Voted
IJPP
2008
15 years 3 months ago
2008
We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, b...