Sciweavers

156 search results - page 25 / 32
» On the Round Complexity of Covert Computation
Sort
View
CEC
2010
IEEE
13 years 8 months ago
Applying cooperative coevolution to compete in the 2009 TORCS Endurance World Championship
The TORCS Endurance World Championship is an international competition in which programmers develop and tune their drivers to race against each other using TORCS, a state-of-the-ar...
Luigi Cardamone, Daniele Loiacono, Pier Luca Lanzi
LICS
2000
IEEE
13 years 11 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
DAC
2006
ACM
14 years 8 months ago
A real time budgeting method for module-level-pipelined bus based system using bus scenarios
In designing bus based systems with parallel and pipelined architecture, it is important to derive a real time budget (a specified execution time limit) for each task of a bus bas...
Tadaaki Tanimoto, Seiji Yamaguchi, Akio Nakata, Te...
ICARCV
2008
IEEE
170views Robotics» more  ICARCV 2008»
14 years 1 months ago
Mixed state estimation for a linear Gaussian Markov model
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
Argyris Zymnis, Stephen P. Boyd, Dimitry M. Gorine...
PODC
2005
ACM
14 years 28 days ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer