Sciweavers

2479 search results - page 484 / 496
» A Computational Theory of Working Memory
Sort
View
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
14 years 1 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
MMMACNS
2005
Springer
14 years 1 months ago
Networks, Markov Lie Monoids, and Generalized Entropy
The continuous general linear group in n dimensions can be decomposed into two Lie groups: (1) an n(n-1) dimensional ‘Markov type’ Lie group that is defined by preserving the ...
Joseph E. Johnson
MOBICOM
2004
ACM
14 years 28 days ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh
NETGAMES
2004
ACM
14 years 28 days ago
Lightweight QoS-support for networked mobile gaming
In this paper, we present an approach to provide Quality of Service (QoS) for networked mobile gaming. In order to examine the QoS requirements of mobile games, we ported a simple...
Marcel Busse, Bernd Lamparter, Martin Mauve, Wolfg...
SIGCOMM
2004
ACM
14 years 28 days ago
Sizing router buffers
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...
Guido Appenzeller, Isaac Keslassy, Nick McKeown