نتایج جستجو برای: alice code

تعداد نتایج: 173826  

Journal: :Applied Mathematics and Computer Science 2015
David Gañán Santi Caballé Jordi Conesa Fatos Xhafa

This contribution proposes software infrastructure to support new types of learning methodologies and resources based on collaborative knowledge engineering by means of an innovative application framework called the virtualized collaborative sessions framework (VCSF). The VCSF helps meet challenging collaborative knowledge engineering requirements in online learning, such as increasing group me...

2014
Peter Burcsi Gabriele Fici Zsuzsanna Lipták Frank Ruskey Joe Sawada

A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present results about the number pnw(n) of prefix normal words of length n, showing that pnw(n) = Ω ( 2n−c √ n lnn ) for some c and pnw(n) = O ( 2(lnn) n ) . We introduce eff...

Journal: :CoRR 2015
Samuel Epstein

This article presents a quantum transmission problem, in which Alice is trying to send a number of qbits to Bob. Alice has access to two channels, one that sends classical bits and another that sends quantum bits. We show that under certain error terms, Alice can optimize transmission, up to logarithmic precision, by sending only a classical description of the qbits.

Journal: :EPJ Web of Conferences 2016

Journal: :The Gerontologist 2015

Journal: :Nature 1971

2000
P. Vande Vyvre O. Villalobos Baillie

The principal features of the ALICE Central Trigger Processor are presented, as described in the draft User Requirement Document currently under discussion.

Journal: :EPJ Web of Conferences 2013

Journal: :Nature Medicine 2006

Journal: :Discrete Mathematics 2015
Daniel Hoske Jonathan Rollin Torsten Ueckerdt Stefan Walzer

We consider the weighted version of the Tron game on graphs where two players, Alice and Bob, each build their own path by claiming one vertex at a time, starting with Alice. The vertices carry non-negative weights that sum up to 1 and either player tries to claim a path with larger total weight than the opponent. We show that if the graph is a tree then Alice can always ensure to get at most 1...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید