3652 search results - page 378 / 731 » A study of query length |
112
click to vote
IPL
2008
15 years 4 months ago
2008
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
125
click to vote
JCSS
2008
15 years 4 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
162
click to vote
CPHYSICS
2007
15 years 4 months ago
2007
Simulation of biomembranes over length and time scales relevant to cellular biology is not currently feasible with molecular dynamics including full atomic detail. Barring an unfo...
120
click to vote
ITA
2006
15 years 4 months ago
2006
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
110
click to vote
DMTCS
2007
15 years 4 months ago
2007
A binary sequence of zeros and ones is called a (d, k)-sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, b...