Sciweavers

9849 search results - page 282 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
IPPS
1997
IEEE
15 years 11 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
ICC
2007
IEEE
143views Communications» more  ICC 2007»
15 years 11 months ago
DARA: Delay-Aware Routing Algorithm in a Hybrid Wireless-Optical Broadband Access Network (WOBAN)
Abstract-- Hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future network operations. Recently, the wireless part of WOBAN has been gaining...
Suman Sarkar, Hong-Hsu Yen, Sudhir S. Dixit, Biswa...
FPL
2004
Springer
144views Hardware» more  FPL 2004»
15 years 11 months ago
A Methodology for Energy Efficient FPGA Designs Using Malleable Algorithms
A recent trend towards integrating FPGAs with many heterogeneous components, such as memory systems, dedicated multipliers, etc., has made them an attractive option for implementin...
Jingzhao Ou, Viktor K. Prasanna
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 11 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
NIPS
1997
15 years 8 months ago
Learning Generative Models with the Up-Propagation Algorithm
Up-propagation is an algorithm for inverting and learning neural network generative models. Sensory input is processed by inverting a model that generates patterns from hidden var...
Jong-Hoon Oh, H. Sebastian Seung