Sciweavers

10805 search results - page 1853 / 2161
» Mapping Computation with No Memory
Sort
View
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 6 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
DCC
2003
IEEE
16 years 6 months ago
Code Compression Using Variable-to-fixed Coding Based on Arithmetic Coding
Embedded computing systems are space and cost sensitive; memory is one of the most restricted resources, posing serious constraints on program size. Code compression, which is a s...
Yuan Xie, Wayne Wolf, Haris Lekatsas
ASIACRYPT
2009
Springer
16 years 1 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
ATAL
2009
Springer
16 years 1 months ago
Bounded rationality via recursion
Current trends in model construction in the field of agentbased computational economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictit...
Maciej Latek, Robert L. Axtell, Bogumil Kaminski
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
16 years 1 months ago
Why evolution is not a good paradigm for program induction: a critique of genetic programming
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
John R. Woodward, Ruibin Bai
« Prev « First page 1853 / 2161 Last » Next »