Sciweavers

3353 search results - page 88 / 671
» Laver and set theory
Sort
View
FSTTCS
2001
Springer
15 years 2 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
NIPS
2000
14 years 11 months ago
Foundations for a Circuit Complexity Theory of Sensory Processing
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
Robert A. Legenstein, Wolfgang Maass
JCT
2002
52views more  JCT 2002»
14 years 9 months ago
A Result in Dual Ramsey Theory
We present a result which is obtained by combining a result of Carlson with the Finitary Dual Ramsey Theorem of Graham-Rothschild. We start by introducing some notation. We confor...
Lorenz Halbeisen, Pierre Matet
INFOCOM
2010
IEEE
14 years 7 months ago
An Axiomatic Theory of Fairness in Network Resource Allocation
We present a set of five axioms for fairness measures in resource allocation. A family of fairness measures satisfying the axioms is constructed. Well-known notions such as -fairne...
Tian Lan, David Kao, Mung Chiang, Ashutosh Sabharw...
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 10 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...