Sciweavers

835 search results - page 67 / 167
» Geometric Logic in Computer Science
Sort
View
FOCS
2006
IEEE
14 years 2 months ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
CDC
2009
IEEE
160views Control Systems» more  CDC 2009»
14 years 1 months ago
Receding horizon temporal logic planning for dynamical systems
— This paper bridges the advances in computer science and control to allow automatic synthesis of control strategies for complex dynamical systems which are guaranteed, by constr...
Tichakorn Wongpiromsarn, Ufuk Topcu, R. Richard Mu...
LICS
2008
IEEE
14 years 3 months ago
A Logical Characterization of Individual-Based Models
Individual-based models are a relatively new approach to modelling dynamical systems of interacting entities, for example molecules in a biological cell. Although they are computa...
James F. Lynch
COMPGEOM
2006
ACM
14 years 2 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
ICTCS
2003
Springer
14 years 1 months ago
Algebraic Theories for Contextual Pre-nets
The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious beh...
Roberto Bruni, José Meseguer, Ugo Montanari...