Sciweavers

171 search results - page 20 / 35
» Weak theories of linear algebra
Sort
View
LICS
1990
IEEE
13 years 10 months ago
Normal Process Representatives
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
Vijay Gehlot, Carl A. Gunter
GECCO
2004
Springer
14 years 3 days ago
On the Strength of Size Limits in Linear Genetic Programming
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
Nicholas Freitag McPhee, Alex Jarvis, Ellery Fusse...
CORR
2008
Springer
79views Education» more  CORR 2008»
13 years 6 months ago
A System Theoretic Approach to Bandwidth Estimation
It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed i...
Jörg Liebeherr, Markus Fidler, Shahrokh Valae...
CADE
2008
Springer
14 years 7 months ago
Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
Anders Schack-Nielsen, Carsten Schürmann
FOCS
2002
IEEE
13 years 11 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich