Sciweavers

1484 search results - page 256 / 297
» Ants meeting algorithms
Sort
View
PERCOM
2007
ACM
15 years 9 months ago
Achieving Flexible Cache Consistency for Pervasive Internet Access
Caching is an important technique to support pervasive Internet access. Cache consistency measures the deviation between the cached data and the source data. In mobile computing e...
Yu Huang 0002, Jiannong Cao, Zhijun Wang, Beihong ...
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 6 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
ICCAD
2004
IEEE
155views Hardware» more  ICCAD 2004»
15 years 6 months ago
A flexibility aware budgeting for hierarchical flow timing closure
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
Olivier Omedes, Michel Robert, Mohammed Ramdani
ATAL
2009
Springer
15 years 4 months ago
Sensitivity analysis for distributed optimization with resource constraints
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
Emma Bowring, Zhengyu Yin, Rob Zinkov, Milind Tamb...
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 4 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim