Sciweavers

3820 search results - page 59 / 764
» Bounded Model Debugging
Sort
View
AUTOMATICA
2008
81views more  AUTOMATICA 2008»
15 years 2 months ago
Robust supervisory control of timed discrete event systems under partial observation based on eligible time bounds: The existenc
This paper addresses a supervisory control problem for uncertain timed discrete event systems (DESs) under partial observation. An uncertain timed DES to be controlled is represen...
Seong-Jin Park, Kwang-Hyun Cho
STACS
2009
Springer
15 years 6 months ago
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
Andre Gronemeier
FAW
2009
Springer
144views Algorithms» more  FAW 2009»
15 years 6 months ago
Communication Complexity and Its Applications
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
Andrew Chi-Chih Yao
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 2 months ago
Multiparty Communication Complexity of Disjointness
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
Arkadev Chattopadhyay, Anil Ada