686 search results - page 130 / 138 » Packing Cycles in Graphs |
ISCA
1992
IEEE
15 years 1 months ago
1992
IEEE
A quantitative analysis of program execution is essential to the computer architecture design process. With the current trend in architecture of enhancing the performance of unipr...
ASPDAC
2008
ACM
14 years 11 months ago
2008
ACM
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
103
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...
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
101
click to vote
IJCAI
2007
14 years 11 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...