Sciweavers

922 search results - page 45 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
IANDC
2008
101views more  IANDC 2008»
13 years 10 months ago
Trees with exponentially growing costs
We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in ...
Frank Schulz
CSFW
2005
IEEE
14 years 4 months ago
Deciding Knowledge in Security Protocols under (Many More) Equational Theories
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
Martín Abadi, Véronique Cortier
FCT
1999
Springer
14 years 2 months ago
On Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
Manfred Droste, Dietrich Kuske
GECCO
2008
Springer
127views Optimization» more  GECCO 2008»
13 years 11 months ago
On the possibility to create a compatible--complete unary comparison method for evolutionary multiobjective algorithms
There are several studies on the desirable properties that a performance measure for evolutionary multiobjective algorithms must have. One of these properties is called “compati...
Giovanni Lizárraga Lizárraga, Arturo...
JCT
2008
81views more  JCT 2008»
13 years 10 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt