569 search results - page 71 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
NCA
2003
IEEE
14 years 27 days ago
2003
IEEE
This paper studies the optimal placement of web files for en-route web caching. It is shown that existing placement policies are all solving restricted partial problems of the ...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...
ISCAPDCS
2003
13 years 9 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
ARGMAS
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we propose a new persuasion dialogue game for agent communication. We show how this dialogue game is modeled by a framework based on social commitments and arguments....
DAC
2005
ACM
14 years 8 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...