Sciweavers

3049 search results - page 31 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
14 years 24 days ago
An Optimization Solution for Packet Scheduling: A Pipeline-Based Genetic Algorithm Accelerator
Abstract. The dense wavelength division multiplexing (DWDM) technique has been developed to provide a tremendous number of wavelengths/channels in an optical fiber. In the multi-c...
Shiann-Tsong Sheu, Yue-Ru Chuang, Yu-Hung Chen, Eu...
WIOPT
2010
IEEE
13 years 5 months ago
Delay efficient scheduling via redundant constraints in multihop networks
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
Longbo Huang, Michael J. Neely
ISPD
1998
ACM
101views Hardware» more  ISPD 1998»
13 years 11 months ago
Greedy wire-sizing is linear time
—The greedy wire-sizing algorithm (GWSA) has been experimentally shown to be very efficient, but no mathematical analysis on its convergence rate has ever been reported. In this...
Chris C. N. Chu, D. F. Wong
NIPS
2004
13 years 9 months ago
The Convergence of Contrastive Divergences
This paper analyses the Contrastive Divergence algorithm for learning statistical parameters. We relate the algorithm to the stochastic approximation literature. This enables us t...
Alan L. Yuille
ISSTA
2004
ACM
14 years 1 months ago
Optimal strategies for testing nondeterministic systems
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...