Filters








9,762 Hits in 4.3 sec

Graded Computation Tree Logic with Binary Coding [chapter]

Alessandro Bianco, Fabio Mogavero, Aniello Murano
2010 Lecture Notes in Computer Science  
However, GCTL has been only investigated w.r.t. graded numbers coded in unary, while Gµ-CALCULUS uses for this a binary coding, and it was left open the problem to decide whether the same result may or  ...  Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the branching-time temporal logic CTL  ...  By [1] , it holds that |C(n)| = Θ( 1 n · 2 k· √ n ), with k = π · loge · 2/3. Full Graded Computation Tree Logic We now define syntax and semantics of GCTL*. Syntax.  ... 
doi:10.1007/978-3-642-15205-4_13 fatcat:jbnz3kesfvdorluldngrx3dq4e

Graded Computation Tree Logic

Alessandro Bianco, Fabio Mogavero, Aniello Murano
2009 2009 24th Annual IEEE Symposium on Logic In Computer Science  
properties of computation trees.  ...  We call the logic CTL extended with graded path modalities GCTL, for short.  ...  properties of computation trees.  ... 
doi:10.1109/lics.2009.28 dblp:conf/lics/BiancoMM09 fatcat:5dj7hqhrojbllmauzvaipwn2te

Graded computation tree logic

Alessandro Bianco, Fabio Mogavero, Aniello Murano
2012 ACM Transactions on Computational Logic  
properties of computation trees.  ...  We call the logic CTL extended with graded path modalities GCTL, for short.  ...  properties of computation trees.  ... 
doi:10.1145/2287718.2287725 fatcat:2h62k6brdje2zkxgjgdd36f7na

Graded Computation Tree Logic [chapter]

Fabio Mogavero
2013 Logics in Computer Science  
properties of computation trees.  ...  We call the logic CTL extended with graded path modalities GCTL, for short.  ...  properties of computation trees.  ... 
doi:10.2991/978-94-91216-95-4_1 fatcat:ip7uqjm5ffe2hpcxger63dw2iu

Informatics at Russian Secondary School

Vladimir M. KIRYUKHIN, Marina S. TSVETKOVA
2016 OLYMPIADS IN INFORMATICS  
representation in relation to a particular task (lists, graphs, arrays, tables, schemes, graphics, diagrams and hierarchical structures) and using relevant programs of data processing; the idea of a computer  ...  the real world, about the role of information technology and automated devices in people's lives, as well as in industry and scientific research; skills and abilities for safe and appropriate use of computers  ...  Section "The binary alphabet" (4 hours) 7 • th -9 th grade The representation of data in a computer as texts in a binary alphabet. Binary code with a fixed codeword length.  ... 
doi:10.15388/ioi.2016.special.03 fatcat:a5kz7zm4ujenpi22tmhlitodo4

The Complexity of the Graded μ-Calculus [chapter]

Orna Kupferman, Ulrike Sattler, Moshe Y. Vardi
2002 Lecture Notes in Computer Science  
numbers in the graded modalities are coded in binary.  ...  In this paper we study the graded -calculus, which extends graded modal logic with fixed-point operators, or, equivalently, extends classical -calculus with graded modalities.  ...  For many logics with counting quantifiers, the complexity of the satisfiability problem is known for unary coding only, and is unknown for binary coding.  ... 
doi:10.1007/3-540-45620-1_34 fatcat:5nnxd2yym5cx3heewhzupe42zy

Performance Evaluation of Classification Techniques for Computer Vision based Cashew Grading System

Mayur Thakkar, Malay Bhatt, C. K. Bhensdadia
2011 International Journal of Computer Applications  
The purpose of this study is to develop the computer vision based cashew grading system in conjunction with most accurate classification technique.  ...  most suitable classification technique for the cashew grading system.  ...  Instead of just having one neuron in the output layer, with binary output, we could have N binary neurons.  ... 
doi:10.5120/2291-2975 fatcat:6f2weqhxivep5ckrtlonjkfhuu

A Geometric Algebra Implementation using Binary Tree

Stéphane Breuils, Vincent Nozick, Laurent Fuchs
2017 Advances in Applied Clifford Algebras  
This paper presents an efficient implementation of geometric algebra, based on a recursive representation of the algebra elements using binary trees.  ...  The method is compared with the main state of the art geometric algebra implementations, with a time complexity study as well as a practical benchmark.  ...  The labelling of the binary tree enables to efficiently extract the leaves of c whose grade is L. An algorithm is produced and consists in traversing the binary tree of c.  ... 
doi:10.1007/s00006-017-0770-6 fatcat:2iuolx4drbafzjke64rzjn3hiq

A hybrid approach for computing products of high-dimensional geometric algebras

Stéphane Breuils, Vincent Nozick, Laurent Fuchs, Dietmar Hildenbrand, Werner Benger, Christian Steinmetz
2017 Proceedings of the Computer Graphics International Conference on - CGI '17  
CONCLUSION In this paper, we presented a new Geometric Algebra implementation with a hybrid design between precomputations with tables and on-the-y computations with a recursive binary tree. e program  ...  Firstly, we test the memory occupation of our binary tree approach with the table based approach in the worst case. is worst case corresponds to the full binary tree (2 d non-null leaves).  ... 
doi:10.1145/3095140.3097284 dblp:conf/cgi/BreuilsNFHBS17 fatcat:rhy5paehtbfvtauekb74zhjhzm

Implementation of Fast Radix-10 BCD Multiplier in FPGA

H. A. Anil Kumar, S. Umadevi
2015 Indian Journal of Science and Technology  
ODDS representation uses 4-bit binary encoding technique which is similar to non-redundant BCD code, for this reason conventional VLSI circuit techniques such as carry-save adders and compression trees  ...  The design exploits two properties of redundant BCD codes to speed up its computation. Namely, the redundant BCD excess-3 code (XS-3), and the overloaded BCD representation (ODDS).  ...  The high level architecture of the PPR consists of three parts: (1) A regular binary Carry save adder tree to compute an estimation of decimal partial product sum in a binary carry save form (S, C), (2  ... 
doi:10.17485/ijst/2015/v8i19/77160 fatcat:s4c4ikhajjeuremfx2xjl7vyjq

Providing Data Structure Animations in a Lightweight IDE

Dean Hendrix, James H. Cross, Jhilmil Jain, Larry Barowski
2007 Electronical Notes in Theoretical Computer Science  
The seamless integration of the the IDE with pedagogically effective software visualizations makes jGRASP an interesting tool for both educators and students.  ...  This paper presents the data structure animation tool jGRASP, which can automatically generate multiple synchronized views while the underlying code is being developed.  ...  A Java program that implemented a linked binary search tree was provided.  ... 
doi:10.1016/j.entcs.2007.01.039 fatcat:5nehhew7r5hbvnue3kvhbmf6zm

Logic Regression for Provider Effects on Kidney Cancer Treatment Delivery

Mousumi Banerjee, Christopher Filson, Rong Xia, David C. Miller
2014 Computational and Mathematical Methods in Medicine  
This paper presents a novel application of logic regression in the context of kidney cancer treatment delivery.  ...  Logic regression allowed us to uncover the interplay between patient, provider, and practice environment variables, which would not be possible using standard regression approaches.  ...  Logic regression requires binary predictor variables, so we recoded variables into binary forms. Categorical covariates were coded as a set of indicator variables for each level of the covariate.  ... 
doi:10.1155/2014/316935 pmid:24795774 pmcid:PMC3985159 fatcat:wdq4yljlyvgh7gg7gf4uucqclu

Design and Implementation of Efficient Reversible Arithmetic and Logic Unit

Subramanian Saravanan, Ila Vennila, Sudha Mohanram
2016 Circuits and Systems  
In computing architecture, ALU plays a major role. Many promising applications are possible with ATMEGA microcontroller. ALU is a part of these microcontrollers.  ...  In this paper, an efficient reversible Arithmetic and Logic Unit with reversible Vedic Multiplier is proposed and the simulation results show its effectiveness in reducing quantum cost, number of gates  ...  In this current bit is operated with previous bit. The Q1 7 -Q1 0 represents binary to gray code converted value.  ... 
doi:10.4236/cs.2016.76054 fatcat:eonyloeu5bfalf4jf6x6tkuzzq

Dynamic object viewers for data structures

James H. Cross, T. Dean Hendrix, Jhilmil Jain, Larry A. Barowski
2007 Proceedinds of the 38th SIGCSE technical symposium on Computer science education - SIGCSE '07  
These viewers provide multiple synchronized visualizations of data structures as the user steps through the source code in either debug or workbench mode.  ...  Recently completed controlled experiments with CS2 students indicate that these viewers can have a significant positive impact on student performance.  ...  A Java program implementing a linked binary search tree with five logical errors, one in each of the following methods addElement(), findAgain(), removeElement(), inOrder() and postOrder() was provided  ... 
doi:10.1145/1227310.1227316 dblp:conf/sigcse/CrossCHJB07 fatcat:n3s7rgzggjaljovn2nfjh5q5c4

Ad Exchange Optimization Algorithms on Advertising Networks

Luis Miralles Pechuán, Claudia Sánchez Gómez, Lourdes Martínez Villaseñor
2014 Research in Computing Science  
To face this problem we have developed algorithms using techniques such as threads, AVL trees with hash, multiple node trees or Hadoop technology.  ...  Advertisers have gotten better results with campaigns targeted at more specific audiences.  ...  A binary search tree is a data structure allowing the organization of attribute information; each tree node must comply with the following characteristics: Lower Nodes to the left of a particular node  ... 
doi:10.13053/rcs-84-1-7 fatcat:momxmicakjforjmpxn7i7z5xca
« Previous Showing results 1 — 15 out of 9,762 results