2814 search results - page 172 / 563 » Competitive Analysis of Distributed Algorithms |
110
click to vote
JAR
2000
15 years 2 months ago
2000
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
110
Voted
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
Text summarization is a data reduction process. The use of text summarization enables users to reduce the amount of text that must be read while still assimilating the core inform...
150
click to vote
SYNTHESE
2008
2008
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
15 years 2 months ago
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
104
click to vote
JSSPP
2004
Springer
15 years 7 months ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
122
click to vote
ATAL
2003
Springer
15 years 7 months ago
2003
Springer
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...