نتایج جستجو برای: squad

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

Journal: :Theor. Comput. Sci. 2002
Amber Settle Janos Simon

In this paper we improve the bounds on the complexity of solutions to the ̄ring squad problem, also known as the ̄ring synchronization problem. In the ̄ring synchronization problem we consider a one-dimensional array of n identical ̄nite automata. Initially all automata are in the same state except for one automaton designated as the initiator for the synchronization. Our results hold for the origi...

2017
Chase Brandon Michael Holloway

This paper describes attempts at developing a high performance reading comprehension model. Reading comprehension, in the current context, is defined as extracting textual answers from context passages given qualitative text questions. To train and test our comprehension model, we use Stanford’s SQuAD dataset, a standard dataset for comprehension tasks. We present our initial implementation of ...

2014
Roland G. Roberts

While genome sequences now pour out of factories, each yielding in turn the sequences of thousands of proteins, it’s been harder to scale up our understanding of what these proteins actually look like and what they do for a living. This is largely because DNA is DNA, wherever you look, enabling the same technology to be applied to any segment of any genome. Solving the three-dimensional molecul...

2017
Yutong Li Prateek Murgai

This project explores the multi-perspective context matching method for the task of reading comprehension using the SQuAD data set. The original six layer model presents an interesting system for exploring deep learning architectures and their implementations on Tensorflow.The first step was to design an efficient implementation of this complex model on Tensorflow. The second step, and the aim ...

1997
Zhi-zhong Xing

By use of the one-loop renormalization group equations and current experimental data, we study the off-diagonal asymmetries of the Cabibbo-Kobayashi-Maskawa (CKM) matrix at the GUT scale in the framework of the standard model as well as its two Higgs and supersymmetric extensions. It is concluded that the possibility of a symmetric CKM matrix at the GUT scale has almost been ruled out.

1995
Oscar Garcia-Prada STEVEN B. BRADLOW OSCAR GARCIA-PRADA

We introduce equations for special metrics, and notions of stability for some new types of augmented holomorphic bundles. These new examples include holomorphic extensions, and in this case we prove a Hitchin-Kobayashi correspondence between a certain deformation of the Hermitian-Einstein equations and our definition of stability for an extension. §

1994
Alon E. Faraggi

We examine the problem of three generation quark flavor mixing in realistic, superstring derived standard–like models, constructed in the free fermionic formulation. We study the sources of family mixing in these models and discuss the necessary conditions to obtain a realistic Cabibbo–Kobayashi–Maskawa (CKM) mixing matrix. In a specific model, we estimate the mixing angles and discuss the weak...

2008
Hiroshi Umeo Jean-Baptiste Yunès Naoki Kamikawa

We present some elements of a new family of time-optimal solutions to a less restrictive firing squad synchronization problem. These solutions are all built on top of some elementary algebraic cellular automata. Thus, this gives a very new insight on the problem and a more general way of computing on cellular automata.

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

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