874 search results - page 10 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
AMAI
1999
Springer
14 years 11 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
106
click to vote
LSSC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
118
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
AAAI
2004
15 years 1 months ago
2004
The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we...