Sciweavers

37 search results - page 3 / 8
» Symbolic negotiation revisited
Sort
View
ICALP
2009
Springer
14 years 6 months ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...
ENTCS
2002
80views more  ENTCS 2002»
13 years 6 months ago
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited
In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data struct...
Alain Finkel, Jean-François Raskin, Mathias...
LOGCOM
2007
59views more  LOGCOM 2007»
13 years 6 months ago
Forgetting Literals with Varying Propositional Symbols
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to...
Yves Moinard
JCM
2008
104views more  JCM 2008»
13 years 6 months ago
An OFDM Symbol Design for Reduced Complexity MMSE Channel Estimation
In this paper we revisit the minimum mean square error (MMSE) pilot-aided channel estimation for broadband orthogonal frequency division multiplexing (OFDM) systems. The careful de...
Carlos Ribeiro, Atílio Gameiro