Sciweavers

76 search results - page 5 / 16
» isaac 2005
Sort
View
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Counting Stable Strategies in Random Evolutionary Games
In this paper we study the notion of the Evolutionary Stable Strategies (ESS) in evolutionary games and we demonstrate their qualitative difference from the Nash Equilibria, by sh...
Spyros C. Kontogiannis, Paul G. Spirakis
ISAAC
2005
Springer
135views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Embedding Point Sets into Plane Graphs of Small Dilation
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
Annette Ebbers-Baumann, Ansgar Grüne, Marek K...
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Upper Bounds on the Computational Power of an Optical Model of Computation
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
Damien Woods
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
Kenya Ueno
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
14 years 3 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen