5169 search results - page 774 / 1034 » Locality approximation using time |
144
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
155
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
166
click to vote
WCNC
2008
IEEE
15 years 11 months ago
2008
IEEE
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
150
click to vote
CF
2010
ACM
15 years 10 months ago
2010
ACM
We develop two simple interval-based models for dynamic superscalar processors. These models allow us to: i) predict with great accuracy performance and power consumption under va...
181
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...