Sciweavers

4342 search results - page 79 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Scalable Routing Via Greedy Embedding
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
Cédric Westphal, Guanhong Pei
PLDI
2003
ACM
14 years 3 months ago
Meta optimization: improving compiler heuristics with machine learning
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
Mark Stephenson, Saman P. Amarasinghe, Martin C. M...
CEC
2007
IEEE
14 years 4 months ago
Improving generalization capability of neural networks based on simulated annealing
— This paper presents a single-objective and a multiobjective stochastic optimization algorithms for global training of neural networks based on simulated annealing. The algorith...
Yeejin Lee, Jong-Seok Lee, Sun-Young Lee, Cheol Ho...
EUC
2007
Springer
14 years 4 months ago
Consensus-Driven Distributable Thread Scheduling in Networked Embedded Systems
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
Jonathan Stephen Anderson, Binoy Ravindran, E. Dou...
SIROCCO
2004
13 years 11 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
Stefan Dobrev, Paola Flocchini, Nicola Santoro