Sciweavers

417 search results - page 7 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
JSAC
2006
81views more  JSAC 2006»
13 years 8 months ago
Fast linearized energy allocation for multimedia loading on multicarrier systems
Abstract--Efficient near-optimal energy allocation for multimedia data transmission using multicarrier modulation is investigated. The optimal method typically relies on an iterati...
Michael A. Enright, C. C. Jay Kuo
DM
2006
128views more  DM 2006»
13 years 8 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
SIAMSC
2011
113views more  SIAMSC 2011»
13 years 3 months ago
An Efficient Higher-Order Fast Multipole Boundary Element Solution for Poisson-Boltzmann-Based Molecular Electrostatics
In order to compute polarization energy of biomolecules, we describe a boundary element approach to solving the linearized Poisson–Boltzmann equation. Our approach combines sever...
Chandrajit L. Bajaj, Shun-Chuan Albert Chen, Alexa...
AUTOMATICA
2011
13 years 3 months ago
Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms
Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original meth...
William M. McEneaney
JMLR
2006
389views more  JMLR 2006»
13 years 8 months ago
A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis
This paper introduces a learning method for two-layer feedforward neural networks based on sensitivity analysis, which uses a linear training algorithm for each of the two layers....
Enrique Castillo, Bertha Guijarro-Berdiñas,...