Sciweavers

107 search results - page 15 / 22
» Counting with rational generating functions
Sort
View
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 8 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
TEC
2008
127views more  TEC 2008»
13 years 8 months ago
Fingerprinting: Visualization and Automatic Analysis of Prisoner's Dilemma Strategies
Fingerprinting is a technique for generating a representation-independent functional signature for a game playing agent. Fingerprints can be used to compare agents across represent...
Daniel A. Ashlock, Eun-Youn Kim
ANTS
2006
Springer
114views Algorithms» more  ANTS 2006»
14 years 11 days ago
The Pseudosquares Prime Sieve
We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...
Jonathan Sorenson
FMCAD
2008
Springer
13 years 10 months ago
Invariant-Strengthened Elimination of Dependent State Elements
Abstract-- This work presents a technology-independent synthesis optimization that is effective in reducing the total number of state elements of a design. It works by identifying ...
Michael L. Case, Alan Mishchenko, Robert K. Brayto...
DM
1998
60views more  DM 1998»
13 years 8 months ago
On numbers of Davenport-Schinzel sequences
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bij...
Martin Klazar