Sciweavers

2479 search results - page 310 / 496
» A Computational Theory of Working Memory
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 1 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
16 years 22 days ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
MOBICOM
2006
ACM
16 years 16 days ago
Fast and reliable estimation schemes in RFID systems
RFID tags are being used in many diverse applications in increasingly large numbers. These capabilities of these tags span from very dumb passive tags to smart active tags, with t...
Murali S. Kodialam, Thyaga Nandagopal
IMC
2003
ACM
15 years 11 months ago
Simple network performance tomography
In network performance tomography, characteristics of the network interior are inferred by correlating end-to-end measurements. In much previous work, the presence of correlations...
Nick G. Duffield
BPM
2008
Springer
155views Business» more  BPM 2008»
15 years 8 months ago
The Refined Process Structure Tree
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
Jussi Vanhatalo, Hagen Völzer, Jana Koehler