8512 search results - page 6 / 1703 » Computing Theory With Relevance |
CIE
2005
Springer
14 years 1 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
FOGA
2011
12 years 11 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Book
"Advances in shape analysis impact a wide range of disciplines, from mathematics and engineering to medicine, archeology, and art. Anyone just entering the field, however, may...
BCSHCI
2007
13 years 9 months ago
2007
The research outlined investigates strategies that nonprogramming or “everyday” users may take in interaction with a Pervasive Computing Environment within relevant domains sp...
APAL
2004
13 years 7 months ago
2004
Modus ponens provides the central theme. There are laws, of the form A C. A logic (or other theory) L collects such laws. Any datum A (or theory T incorporating such data) provid...