Sciweavers

1653 search results - page 286 / 331
» Computer science and game theory
Sort
View
CPHYSICS
2008
96views more  CPHYSICS 2008»
13 years 10 months ago
Moment distributions of clusters and molecules in the adiabatic rotor model
We present a Fortran program to compute the distribution of dipole moments of free particles for use in analyzing molecular beams experiments that measure moments by deflection in...
G. E. Ballentine, G. F. Bertsch, N. Onishi, K. Yab...
PODC
2005
ACM
14 years 3 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
14 years 3 months ago
Monotonic solution concepts in coevolution
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...
Sevan G. Ficici
ANCS
2009
ACM
13 years 7 months ago
Design and performance analysis of a DRAM-based statistics counter array architecture
The problem of maintaining efficiently a large number (say millions) of statistics counters that need to be updated at very high speeds (e.g. 40 Gb/s) has received considerable re...
Haiquan (Chuck) Zhao, Hao Wang, Bill Lin, Jun (Jim...
STACS
2010
Springer
14 years 4 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey