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

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

Journal: :KI 2009
Jürgen Bock

Jüngste Erkenntnisse deuten darauf hin, dass das menschliche Schlussfolgern wohl doch „logischer“ ist als lange Zeit angenommen wurde. Hierdurch motiviert boten neun Dozenten den Teilnehmern der ICCL Summer School ein inhaltlich tiefgreifendes und gleichzeitig vielseitiges Programm an Theorie-Tutorien in den Bereichen der Kognitionswissenschaften und formaler Logik. Der zweiwöchige Zeitrahmen e...

Journal: :Theor. Comput. Sci. 2009
Brandon Blakeley Francine Blanchet-Sadri Josh Gunter Narad Rampersad

Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k ≥ 2, is NP-hard [Theoret. Comput. Sci. 410 (2009) 968–972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. U...

Journal: :به نژادی نهال و بذر 0
اسماعیل بیضایی e. beyzaei, seed and plant improvement institute, karaj, iran.موسسه تحقیقات اصلاح و تهیه نهال و بذر، کرج حمیدرضا دری h. r. dorri علی اکبر قنبری a. a. ghanbari حسین غفاری خلیق h. gaffari khaligh عطیه رحمانی قبادی a. rahmani ghobadi منوچهر طاهری مازندرانی m. taheri mazandarani,

line g-14088 was first introduce in iran together with 60 other chitti bean lines in 1988 through ciat. it was tested in different breeding experiments for yield and agronomic characteristics and was compared with local cultivar checks and other advanced lines of chiti bean from 1988 to 2005 in different locations of iran. due to higher seed yield and favorable characteristics, it was selected ...

2005
M. Alberti F. Athienitou A. Bracciali F. Chesani U. Endriss M. Gavanelli A. Kakas E. Lamma W. Lu P. Mancarella P. Mello F. Sadri K. Stathis P. Torroni

This deliverable reports the work conducted within the SOCS project for workpackage WP5 on verifiable properties of computees and their societies. Copyright c © 2005 by the SOCS Consortium. The SOCS Consortium consists of the following partners: Imperial College of Science, Technology and Medicine, University of Pisa, City University, University of Cyprus, University of Bologna, University of F...

2005
F. Sadri

In this document we introduce, formalise and prove a number of Coherence Properties. These properties are aimed at demonstrating some beneficial consequences of some of the design decisions made in the declarative and computational models of computees. Copyright c © 2005 by the SOCS Consortium. The SOCS Consortium consists of the following partners: Imperial College of Science, Technology and M...

2014

BACKGROUND Rice, Oryza sativa L., is the staple food for half the world's population. By 2030, the production of rice must increase by at least 25% in order to keep up with global population growth and demand. Accelerated genetic gains in rice improvement are needed to mitigate the effects of climate change and loss of arable land, as well as to ensure a stable global food supply. FINDINGS We...

2014
F. Blanchet-Sadri James D. Currie Narad Rampersad Nathan Fox

We study the combinatorics of vtm, a variant of the Thue-Morse word generated by the non-uniform morphism 0 7! 012, 1 7! 02, 2 7! 1 starting with 0. This infinite ternary sequence appears a lot in the literature and finds applications in several fields such as combinatorics on words; for example, in pattern avoidance it is often used to construct infinite words avoiding given patterns. It has b...

2011
Javad Sadri Abdoulaye Baniré Diallo Mathieu Blanchette

MOTIVATION The identification of non-coding functional regions of the human genome remains one of the main challenges of genomics. By observing how a given region evolved over time, one can detect signs of negative or positive selection hinting that the region may be functional. With the quickly increasing number of vertebrate genomes to compare with our own, this type of approach is set to bec...

2008
Josh Gunter Brandon Blakeley

This paper considers the problem of finding avoiding words given sets of partial words of the form {a 1a m2 . . . ka, b 1b n2 . . . lb} where a and b are letters in the alphabet and is a hole, or showing the set is unavoidable. Such a set is avoidable if and only if there exists a two-sided infinite full word with no factor compatible with a member of the set, and this word is called the avoidi...

2005
K. Stathis F. Toni

This is a report on profile-related properties of computees, providing an annex to deliverableD13. We study various profiles of behaviour by giving formal definitions and proving certainproperties for each profile. Copyright c© 2005 by the SOCS Consortium. The SOCS Consortium consists of the following partners: Imperial College of Science, Technology and Medicine, University of ...

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

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