Перейти к основному содержанию
Мемориальная библиотека А.П. Ершова
Toggle navigation
Издания
Журналы
Новые поступления
Вы здесь
Главная
Bulletin of the Novosibirsk Computing Center
Связанные издания:
Action refinement and equivalence notions for timed event structures
A language of actions in ontological transition systems
ALC for CLA: Towards description logic on concept lattices
Alias calculus for a simple imperative language with decidable pointer arithmetic
An approach to construction and analysis of a corpus of short Russian texts intended to train a sentiment classifier
An approach to development of the decision support system for enterprise with complex technological infrastructure
An efficient associative algorithm for multi-comparand parallel searching and its applications
An extension of a visualization component of ontology based portals with visual analytics facilities
Animat control system based on semantic probabilistic inference
An Investigation of Equivalence Notions on Some Subclasses of Petri Nets
An ontology-oriented approach to constructing user interfaces for an informational computational system to support innovations
A notation of congruence for dtsPBC
A parallel algorithm for solving the traveling salesman problem by a recurrent neural network
A reliable linear constraint solver for the UniCalc system
A research automation system for macroeconomic modeling
Associative parallel algorithm for dynamic reconstruction of the shortest paths tree after insertion of a vertex
A three-stage method of C program verification
Back-end translator for Sisal 3.1 compiler
Bisimulation for fluid stochastic Petri nets
Categorical Modelling of trace equivalence for timed automata models with invariants
Causal trees and timed causal trees categorically
Celluar Automata composition techniques for spatial dynamics simulation
Cellular-Neural Computations: Formal Model
Component properties of forgetting and progression in the situation calculus
Compositional methods in characterization of timed event structures
Construction used in associative parallel algorithms for undirected graphs. Part 1
Correct Visualization of solution spaces in the UniCalc system
Cross-language identity resolution and approaches to its solution
Decremental associative algorithm for updating the shortest paths tree
Deductive formal verification of search programs in arrays of arbitrary size for abstract register machines
Domain-Specific transition systems and their application to a formal Definition of a model programming language
Effective generation of verification conditions for non-deterministic unstructured programs
Effective Representation of Algorithm for Finding a Minimal Spanning Tree of a Graph in Associative Parallel Processor
Efficient associative algorithms for implementing the second group of relational algebra operations
Error-tracing axiomatic semantics for C-kernel
Experiments on ontology based semantic systems integration
Experiments on self-applicability in the C-light verification system
Experiments on self-applicability in the C-light verification system. Part 2
Format verification of programs for abstract register machines
Generalized decomposability notions for first-order theories
Graph algorithm interactive visualization
Guided tour inside F@BOOL@: a case-study for a SAT-based verifying compiler
High-Performance Heterogeneous Processing in Concentrating Computing System
Integrated approach to analysis and verification of imperative programs
Introduction on the Atoment language
Investigating Nondeterministic Processes
Iteration in discrete time stochastic Petri box calculus
Logical analysis of texts in a natural language and a sense representation
Make formal semantics easy and useful
Memory organization with parallel access to information and its application for image processing
1
2
следующая ›
последняя »