Sciweavers

9949 search results - page 1772 / 1990
» On the Network Complexity of Selection
Sort
View
APVIS
2009
15 years 7 months ago
Visualization of signal transduction processes in the crowded environment of the cell
In this paper, we propose a stochastic simulation to model and analyze cellular signal transduction. The high number of objects in a simulation requires advanced visualization tec...
Martin Falk, Michael Klann, Matthias Reuss, Thomas...
ATAL
2010
Springer
15 years 7 months ago
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 7 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
HPDC
2010
IEEE
15 years 7 months ago
Cluster-wide context switch of virtualized jobs
Clusters are mostly used through Resources Management Systems (RMS) with a static allocation of resources for a bounded amount of time. Those approaches are known to be insufficie...
Fabien Hermenier, Adrien Lebre, Jean-Marc Menaud
FSTTCS
2008
Springer
15 years 7 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
« Prev « First page 1772 / 1990 Last » Next »