1578 search results - page 13 / 316 » Algorithmic randomness of continuous functions |
ICCD
2001
IEEE
14 years 7 months ago
2001
IEEE
We present a simulation-based semi-formal verification method for sequential circuits described at the registertransfer level. The method consists of an iterative loop where cove...
CEC
2008
IEEE
14 years 5 months ago
2008
IEEE
—The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesi...
ECCV
2008
Springer
15 years 24 days ago
2008
Springer
Recently, models based on conditional random fields (CRF) have produced promising results on labeling sequential data in several scientific fields. However, in the vision task of c...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
COCO
1991
Springer
14 years 2 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...