297 search results - page 55 / 60 » Every Sequence Is Decompressible from a Random One |
102
Voted
DCOSS
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
98
Voted
ECCC
2010
14 years 9 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
108
Voted
STOC
2010
ACM
15 years 3 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
117
click to vote
ECML
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...
100
click to vote
ISIPTA
2003
IEEE
15 years 4 months ago
2003
IEEE
We adopt the same mathematical model of a set M of probability measures as is central to the theory of coherent imprecise probability. However, we endow this model with an objecti...