1017 search results - page 175 / 204 » On the Power of k -Consistency |
93
Voted
APAL
2010
15 years 2 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
106
Voted
ALMOB
2006
15 years 1 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
132
click to vote
COMCOM
2007
15 years 1 months ago
2007
In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as...
102
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
104
click to vote
GPEM
2007
15 years 1 months ago
2007
In this paper, we investigate the employment of evolutionary algorithms as a search mechanism in a decision support system for designing chemotherapy schedules. Chemotherapy invol...