Sciweavers

1279 search results - page 187 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
AAAI
1996
13 years 10 months ago
Building Steady-State Simulators via Hierarchical Feedback Decomposition
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...
Nicolas F. Rouquette
FOCM
2007
94views more  FOCM 2007»
13 years 8 months ago
Trust-Region Methods on Riemannian Manifolds
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
Pierre-Antoine Absil, C. G. Baker, Kyle A. Galliva...
SIGARCH
2008
94views more  SIGARCH 2008»
13 years 8 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
TNN
2008
82views more  TNN 2008»
13 years 8 months ago
Deterministic Learning for Maximum-Likelihood Estimation Through Neural Networks
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
Cristiano Cervellera, Danilo Macciò, Marco ...
PIMRC
2008
IEEE
14 years 3 months ago
A joint routing-MAC model for cellular-relaying networks
—We present an iterative joint scheduling-routing algorithm for characterizing the long-term performance of a cellular-relaying network. The physical layer model is based on idea...
Bogdan Timus, Pablo Soldati