6437 search results - page 309 / 1288 » Parallel Algorithms for Arrangements |
136
Voted
CF
2009
ACM
15 years 8 months ago
2009
ACM
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to mi...
134
click to vote
ENTCS
2008
15 years 3 months ago
2008
We describe a parallel algorithm for solving parity games, with applications in, e.g., modal
142
Voted
HIPC
2003
Springer
15 years 9 months ago
2003
Springer
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
145
Voted
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
130
Voted
JRTIP
2008
15 years 3 months ago
2008
Abstract In an effort to achieve lower bandwidth requirements, video compression algorithms have become increasingly complex. Consequently, the deployment of these algorithms on Fi...