Sciweavers

1521 search results - page 119 / 305
» The Stardinates - Visualizing Highly Structured Data
Sort
View
83
Voted
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
15 years 7 months ago
An efficient approach to unbounded bi-objective archives -: introducing the mak_tree algorithm
Given the prominence of elite archiving in contemporary multiobjective optimisation research and the limitations inherent in bounded population sizes, it is unusual that the vast ...
Adam Berry, Peter Vamplew
CALC
2001
Springer
161views Cryptology» more  CALC 2001»
15 years 8 months ago
The Shortest Vector Problem in Lattices with Many Cycles
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...
Mårten Trolin
120
Voted
WDAS
1998
15 years 4 months ago
A Survey on Counting Networks
In the counting problem, asynchronous concurrent processes repeatedly assign themselves successive values, such as integers or locations in memory. Counting networks are a class o...
Costas Busch, Maurice Herlihy
134
Voted
ET
2000
145views more  ET 2000»
15 years 3 months ago
Fast Test Pattern Generation for Sequential Circuits Using Decision Diagram Representations
The paper presents a novel hierarchical approach to test pattern generation for sequential circuits based on an input model of mixed-level decision diagrams. A method that handles,...
Jaan Raik, Raimund Ubar
132
Voted
NECO
1998
119views more  NECO 1998»
15 years 3 months ago
Density Estimation by Mixture Models with Smoothing Priors
In the statistical approach for self-organizing maps (SOMs), learning is regarded as an estimation algorithm for a Gaussian mixture model with a Gaussian smoothing prior on the ce...
Akio Utsugi