Sciweavers

3367 search results - page 231 / 674
» Incremental assignment problem
Sort
View
MICAI
2007
Springer
15 years 10 months ago
On Conditions for Intermittent Search in Self-organizing Neural Networks
Self-organizing neural networks (SONN) driven by softmax weight renormalization are capable of finding high quality solutions of difficult assignment optimization problems. The r...
Peter Tino
151
Voted
BROADNETS
2006
IEEE
15 years 9 months ago
Design and Dimensioning of a Novel composite-star WDM Network with TDM Channel Partitioning
— This paper presents the design and dimensioning optimization of a novel optical network structure, called the Petaweb, having a total capacity of several Pb/s (1015 bit/s). Its...
Stefano Secci, Brunilde Sansò
146
Voted
ICA
2004
Springer
15 years 9 months ago
Soft-LOST: EM on a Mixture of Oriented Lines
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
Paul D. O'Grady, Barak A. Pearlmutter
149
Voted
EUROMICRO
1999
IEEE
15 years 8 months ago
Design Space Exploration in System Level Synthesis under Memory Constraints
This paper addresses the problem of component selection, task assignment and task scheduling for distributed embedded computer systems. Such systems have a large number of constra...
Radoslaw Szymanek, Krzysztof Kuchcinski
104
Voted
CCS
2007
ACM
15 years 7 months ago
Efficient techniques for realizing geo-spatial access control
The problem of key management for access control systems has been well-studied, and the literature contains several schemes for hierarchy-based and temporal-based access control. ...
Mikhail J. Atallah, Marina Blanton, Keith B. Frikk...