Sciweavers

2479 search results - page 350 / 496
» A Computational Theory of Working Memory
Sort
View
WWW
2004
ACM
16 years 7 months ago
Propagation of trust and distrust
A (directed) network of people connected by ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most s...
Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan...
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 6 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
16 years 20 days ago
Action-selection and crossover strategies for self-modeling machines
In previous work [7] a computational framework was demonstrated that employs evolutionary algorithms to automatically model a given system. This is accomplished by alternating the...
Josh C. Bongard
TELETRAFFIC
2007
Springer
16 years 18 days ago
A Phase-Type Based Markov Chain Model for IEEE 802.16e Sleep Mode and Its Performance Analysis
Abstract. To support battery powered mobile broadband wireless access devices efficiently, IEEE 802.16e defines a sleep mode operation for conserving the power of mobile terminals...
Zhisheng Niu, Yanfeng Zhu, Vilius Benetis
ICFP
2005
ACM
16 years 1 days ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...