Sciweavers

2479 search results - page 281 / 496
» Random Event Structures
Sort
View
ECAL
2005
Springer
15 years 11 months ago
How Do Evolved Digital Logic Circuits Generalise Successfully?
Contrary to indications made by prior researchers, digital logic circuits designed by artificial evolution to perform binary arithmetic tasks can generalise on inputs which were n...
Simon McGregor
DATE
1999
IEEE
111views Hardware» more  DATE 1999»
15 years 9 months ago
Sequential Circuit Test Generation Using Decision Diagram Models
A novel approach to testing sequential circuits that uses multi-level decision diagram representations is introduced. The proposed algorithm consists of a combination of scanning ...
Jaan Raik, Raimund Ubar
LICS
1994
IEEE
15 years 9 months ago
McColm's Conjecture
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of nite structures if every (FO + LFP) formula is equivalent to a rst-order formula in K. H...
Yuri Gurevich, Neil Immerman, Saharon Shelah
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
15 years 9 months ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 5 months ago
A Semidefinite Relaxation for Air Traffic Flow Scheduling
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
Alexandre d'Aspremont, Laurent El Ghaoui