Sciweavers

895 search results - page 32 / 179
» Using graphs for some discrete tomography problems
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 11 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
EPEW
2010
Springer
13 years 11 months ago
Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing
Abstract. The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of c...
Ricardo J. Rodríguez, Jorge Júlvez
DAC
2008
ACM
14 years 12 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 4 months ago
Analysis and Improvements of the Adaptive Discretization Intervals Knowledge Representation
In order to handle classification problems with real-valued attributes using discretization algorithms it is necessary to obtain a good and reduced set of cut points in order to l...
Jaume Bacardit, Josep Maria Garrell i Guiu
DSP
2006
13 years 11 months ago
Non-parametric linear time-invariant system identification by discrete wavelet transforms
We describe the use of the discrete wavelet transform (DWT) for non-parametric linear time-invariant system identification. Identification is achieved by using a test excitation t...
Robert Wing Pong Luk, Robert I. Damper