Sciweavers

2109 search results - page 186 / 422
» Solving Necklace Constraint Problems
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Reinforcement learning for energy-efficient wireless transmission
We consider the problem of energy-efficient point-to-point transmission of delay-sensitive data (e.g. multimedia data) over a fading channel. We propose a rigorous and unified fra...
Nicholas Mastronarde, Mihaela van der Schaar
ICASSP
2011
IEEE
14 years 10 months ago
Stability analysis of multiplicative update algorithms for non-negative matrix factorization
Multiplicative update algorithms have encountered a great success to solve optimization problems with non-negativity constraints, such as the famous non-negative matrix factorizat...
Roland Badeau, Nancy Bertin, Emmanuel Vincent
CP
2005
Springer
16 years 7 hour ago
Speeding Up Constrained Path Solvers with a Reachability Propagator
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
Luis Quesada, Peter Van Roy, Yves Deville
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
15 years 12 months ago
Interconnect design methods for memory design
- This paper presents a solution to the problem of designing interconnects for memory devices. More precisely, it solves the automatic routing problem of memory peripheral circuits...
Chanseok Hwang, Massoud Pedram
ICANN
2009
Springer
15 years 11 months ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch