Sciweavers

199 search results - page 11 / 40
» Intensional Positive Set Theory
Sort
View
COMPGEOM
2004
ACM
14 years 1 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
ICDCSW
2008
IEEE
14 years 2 months ago
Secure Control: Towards Survivable Cyber-Physical Systems
In this position paper we investigate the security of cyberphysical systems. We (1) identify and define the problem of secure control, (2) investigate the defenses that informati...
Alvaro A. Cárdenas, Saurabh Amin, Shankar S...
ICLP
2009
Springer
14 years 8 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
CDC
2008
IEEE
171views Control Systems» more  CDC 2008»
14 years 2 months ago
Constrained optimal control theory for differential linear repetitive processes
Abstract. Differential repetitive processes are a distinct class of continuous-discrete twodimensional linear systems of both systems theoretic and applications interest. These pr...
Michael Dymkov, Eric Rogers, Siarhei Dymkou, Krzys...
SAGA
2007
Springer
14 years 1 months ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis