Sciweavers

1662 search results - page 261 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
FSTTCS
2008
Springer
13 years 9 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
IEEEPACT
2007
IEEE
14 years 3 months ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
GECCO
2005
Springer
197views Optimization» more  GECCO 2005»
14 years 2 months ago
Performance assessment of an artificial immune system multiobjective optimizer by two improved metrics
In this study, we introduce two improved assessment metrics of multiobjective optimizers, Nondominated Ratio and Spacing Distribution, and analyze their rationality and validity. ...
Maoguo Gong, Licheng Jiao, Haifeng Du, Ronghua Sha...
AUTOMATICA
2006
106views more  AUTOMATICA 2006»
13 years 8 months ago
Decentralized receding horizon control for large scale dynamically decoupled systems
A detailed study on the design of decentralized Receding Horizon Control (RHC) schemes for decoupled systems is presented. An optimal control problem is formulated for a set of de...
Tamás Keviczky, Francesco Borrelli, Gary J....
COMCOM
2007
84views more  COMCOM 2007»
13 years 8 months ago
A genetic approach for adding QoS to distributed virtual environments
Distributed Virtual Environment (DVE) systems have been designed last years as a set of distributed servers. These systems allow a large number of remote users to share a single 3...
Silvia Rueda, Pedro Morillo, Juan M. Orduña...