Sciweavers

23 search results - page 1 / 5
» A new class of asynchronous iterative algorithms with order ...
Sort
View
MOC
1998
62views more  MOC 1998»
13 years 7 months ago
A new class of asynchronous iterative algorithms with order intervals
Jean Claude Miellou, Didier El Baz, Pierre Spit&ea...
VLSISP
2002
103views more  VLSISP 2002»
13 years 7 months ago
A New Class of Efficient Block-Iterative Interference Cancellation Techniques for Digital Communication Receivers
A new and efficient class of nonlinear receivers is introduced for digital communication systems. These "iterated-decision" receivers use optimized multipass algorithms t...
Albert M. Chan, Gregory W. Wornell
CP
2007
Springer
14 years 1 months ago
Min-Domain Ordering for Asynchronous Backtracking
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
Roie Zivan, Moshe Zazone, Amnon Meisels
TKDE
2008
112views more  TKDE 2008»
13 years 7 months ago
IDD: A Supervised Interval Distance-Based Method for Discretization
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed metho...
Francisco J. Ruiz, Cecilio Angulo, Núria Ag...
ASIAN
1999
Springer
118views Algorithms» more  ASIAN 1999»
13 years 11 months ago
Asynchronous Links in the PBC and M-Nets
This paper aims at introducing an extension of M-nets, a fully compositional class of high-level Petri nets, and of its low-level counter part, Petri Boxes Calculus (PBC). We intro...
Hanna Klaudel, Franck Pommereau