Sciweavers

699 search results - page 55 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
FCT
1999
Springer
15 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
ADHOCNOW
2003
Springer
15 years 3 months ago
Space-Time Routing in Ad Hoc Networks
We introduce Space-Time Routing (STR), a new approach to routing in mobile ad hoc networks. In STR, the age of routing state is considered jointly with the distance to the destinat...
Henri Dubois-Ferrière, Matthias Grossglause...
FFA
2007
62views more  FFA 2007»
14 years 9 months ago
On the parameters of r-dimensional toric codes
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen constructed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope...
Diego Ruano
IJAR
2006
125views more  IJAR 2006»
14 years 9 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
14 years 11 months ago
Using quotient graphs to model neutrality in evolutionary search
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Dominic Wilson, Devinder Kaur