Results 251 to 260 of about 692,674 (293)

Versatile use of chimpanzee call combinations promotes meaning expansion. [PDF]

Sci Adv
Girard-Buttoz C, Neumann C, Bortolato T, Zaccarella E, Friederici AD, Wittig RM, Crockford C.   +6 more
europepmc   +1 more source

Outsourcing of energetically costly amino acids at the origin of animals. [PDF]

Nat Commun
Kasalo N, Domazet-Lošo M, Domazet-Lošo T.   +2 more
europepmc   +1 more source

Solving multi-depot closed-path multiple traveling salesman problem using k-means++ hierarchical clustering and neural combinatorial networks. [PDF]

Sci Rep
Zhao CS, Wong LP, Fung C.
europepmc   +1 more source

Sensitivity to cuticular hydrocarbons across the odorant receptor family in the Indian jumping ant, <i>Harpegnathos saltator</i>. [PDF]

Front Insect Sci
Tórhalsdóttir R, Morris BI, Masters A, Sieriebriennikov B, Tawawalla A, Naughton LF, Cannizzaro D, Longo J, Ham K, Pomonis B, Lyford A, Millar JG, Pask GM.   +12 more
europepmc   +1 more source

Codepoietic Generation of Meaningful Information in the Evolving Biosphere. [PDF]

Entropy (Basel)
Igamberdiev AU.
europepmc   +1 more source

Multi-State Probabilistic Computing Using Floating-Body MOSFETs Based on the Potts Model for Solving Complex Combinatorial Optimization Problems. [PDF]

Adv Mater
Cheong S, Lee SH, Han J, Park JY, Shin DH, Jang YH, Shim SK, Kim S, Hwang CS, Han JK.   +9 more
europepmc   +1 more source

Codes and combinatorial designs

, 1993
openaire   +1 more source

Combinatorial batch codes [PDF]

Advances in Mathematics of Communications, 2009
In this paper, we study batch codes, which were introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [4]. A batch code specifies a method to distribute a database of [n] items among [m] devices (servers) in such a way that any [k] items can be retrieved by reading at most [t] items from each of the servers.
Maura B Paterson
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

Combinatorial Gray Codes

SIAM Journal on Computing, 1980
We consider families $\{ {\bf C}(n,k):O \leqq k \leqq n\} $ where each ${\bf C}(n,k)$ is a set of combinatorial objects, $C(n,k) = |{\bf C}(n,k)|$ satisfies a recursion $C(n,k)= a_{n,k}C(n - 1,k - 1) + b_{n,k} C(n - 1,k)$, and each object in ${\bf C}(n,k)$ is represented by an n-vector. We study “loop-free” or “uniformly bounded transition” algorithms,
Dennis E White
exaly   +4 more sources