1480 search results - page 289 / 296 » Ants can solve constraint satisfaction problems |
CCR
2000
13 years 10 months ago
2000
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
CGO
2011
IEEE
13 years 2 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
ICDCN
2011
Springer
13 years 2 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
DAC
2009
ACM
14 years 5 months ago
2009
ACM
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...
ISPASS
2006
IEEE
14 years 4 months ago
2006
IEEE
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...