Sciweavers

4908 search results - page 350 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
CCCG
2010
15 years 8 months ago
k-star-shaped polygons
We introduce k-star-shaped polygons, polygons for which there exists at least one point x such that for any point y of the polygon, segment xy crosses the polygon's boundary ...
Jeff Sember, William Evans
AUTOMATICA
2004
122views more  AUTOMATICA 2004»
15 years 6 months ago
Approximate explicit receding horizon control of constrained nonlinear systems
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
Tor Arne Johansen
CORR
2004
Springer
98views Education» more  CORR 2004»
15 years 6 months ago
A feasible algorithm for typing in Elementary Affine Logic
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p...
Patrick Baillot, Kazushige Terui
CORR
2007
Springer
83views Education» more  CORR 2007»
15 years 6 months ago
Time and the Prisoner's Dilemma
B This paper examinesthe integration of computational complexity into gametheoretic models. Theexample focused on is the Prisoner’s Dilemma,repeated for a finite length of time....
Yishay Mor, Jeffrey S. Rosenschein
EDBT
2008
ACM
135views Database» more  EDBT 2008»
16 years 7 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo