6542 search results - page 304 / 1309 » The tao of parallelism in algorithms |
206
click to vote
OTM
2007
Springer
16 years 28 days ago
2007
Springer
Practical scalability of Description Logic (DL) reasoning is an important premise for the adoption of OWL in a real-world setting. Many highly efficient optimizations for the DL ta...
182
Voted
CF
2009
ACM
15 years 11 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...
179
click to vote
ENTCS
2008
15 years 6 months ago
2008
We describe a parallel algorithm for solving parity games, with applications in, e.g., modal
195
click to vote
HIPC
2003
Springer
16 years 8 hour 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/...
202
click to vote
CCO
2001
Springer
15 years 11 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...