4526 search results - page 42 / 906 » Algorithmic problems related to the Internet |
INFORMATICALT
2006
14 years 9 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
IJCAI
2003
14 years 11 months ago
2003
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
105
click to vote
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
Recent progress in Distributed Constraint Optimization Problems (DCOP) has led to a range of algorithms now available which differ in their amount of problem centralization. Probl...