357 search results - page 26 / 72 » Analysis of Transposition-Table-Driven Work Scheduling in Di... |
138
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
142
click to vote
AI
2005
Springer
15 years 3 months ago
2005
Springer
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
123
click to vote
WWW
2010
ACM
15 years 10 months ago
2010
ACM
It has been widely observed that search queries are composed in a very different style from that of the body or the title of a document. Many techniques explicitly accounting for...
140
Voted
SAS
2012
Springer
13 years 5 months ago
2012
Springer
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
159
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...