Results 81 to 90 of about 133,438 (232)
Everything counts in small amounts [PDF]
, 2010 This paper describes an encoding tool which utilises the "data is code" principle of symbolic expressions available in Lisp-like languages to allow the scripting of tightly packed, cross-platform network protocols. This dynamic approach provides specific
Moore, John
core
Boom: Taking Boolean Program Model Checking One Step Further [PDF]
, 2010 We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent variant of counter abstraction, where thread counters are used in a program-context aware way.
Basler G. +5 more
openaire +3 more sources
Alternating Direction Based Sequential Boolean Quadratic Programming Method for Transmit Antenna Selection [PDF]
, 2022 Shijie Zhu, Xu Du
openalex +1 more source
Over-Approximating Boolean Programs with Unbounded Thread Creation
2006 Formal Methods in Computer Aided Design, 2006 This paper describes a symbolic algorithm for over-approximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting the state of the threads to the globally visible parts, which are finite. Our algorithm models recursion by over-approximating the call stack that contains the return locations of ...
Cook, B, Kroening, D, Sharygina, N
openaire +2 more sources
Модели, системы, сети в экономике, технике, природе и обществеBackground. The development of mathematical models of complex objects is usually accompanied by an analysis of their admissibility using both strict formal criteria and procedures, and various heuristic techniques.
S.I. Noskov, S.V. Belyaev, Yu.A. Bychkov
doaj +1 more source
Reducing the Number of Annotations in a Verification-oriented Imperative Language [PDF]
, 2009 Automated software verification is a very active field of research which has made enormous progress both in theoretical and practical aspects. Recently, an important amount of research effort has been put into applying these techniques on top of ...
de Caso, Guido +2 more
core +1 more source
(1+1) Genetic Programming With Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error [PDF]
, 2023 Carola Doerr +2 more
openalex +1 more source
Deriving Trading Rules Using Gene Expression Programming [PDF]
Informatică economică, 2011 This paper presents how buy and sell trading rules are generated using gene expression programming with special setup. Market concepts are presented and market analysis is discussed with emphasis on technical analysis and quantitative methods. The use of
Adrian VISOIU
doaj
Survey on Combinatorial Register Allocation and Instruction Scheduling
, 2018 Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to increase instruction-level parallelism) are essential tasks for generating efficient assembly code in a compiler.
Lozano, Roberto Castañeda +1 more
core
Boolean facility location problem with client preferences
Науковий вісник Ужгородського університету. Серія: Математика і інформатика, 2018 Boolean facility location problem with client preferences is considered. Mathematical model of the problem is built. Branchs and bounds method to solve the problem is proposed. The lower bound calculation method as the solution of the linear programming
Ю. В. Андрашко +1 more
doaj +1 more source