604 search results - page 72 / 121 » On the Complexity of the Maximum Cut Problem |
SI3D
2005
ACM
15 years 3 months ago
2005
ACM
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
SMA
2003
ACM
15 years 3 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
124
click to vote
NOSSDAV
2001
Springer
15 years 2 months ago
2001
Springer
The heterogeneity of the Internet’s transmission resources and end system capability makes it difficult to agree on acceptable traffic characteristics among the multiple receive...
ISCAPDCS
2007
14 years 11 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
AIEDAM
2007
14 years 9 months ago
2007
Achieving the dimensional integrity for a complex structural assembly is a demanding task due to the manufacturing variations of parts and the tolerance relationship between them....