9405 search results - page 36 / 1881 » Computing a Model of Set Theory |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Two mathematical and two computational theories from the field of human and animal learning are combined to produce a more general theory of adaptive behavior. The cornerstone of ...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
TPDS
2010
14 years 8 months ago
2010
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
EATCS
2000
14 years 9 months ago
2000
A sub-area of discrepancy theory that has received much attention in computer science recently, is that of explicit constructions of low-discrepancy point sets for various types o...
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer