Sciweavers

462 search results - page 88 / 93
» Symbolic Bounded Synthesis
Sort
View
LICS
1997
IEEE
15 years 3 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
IJCSA
2007
213views more  IJCSA 2007»
14 years 11 months ago
Adaptive Depth Control for Autonomous Underwater Vehicles Based on Feedforward Neural Networks
This paper studies the design and application of the neural network based adaptive control scheme for autonomous underwater vehicle's (AUV's) depth control system that i...
Yang Shi, Weiqi Qian, Weisheng Yan, Jun Li
TC
1998
14 years 11 months ago
Optimal Zero-Aliasing Space Compaction of Test Responses
—Many built-in self-testing (BIST) schemes compress the test responses from a k-output circuit to q signature streams, where q << k, a process termed space compaction. The ...
Krishnendu Chakrabarty, Brian T. Murray, John P. H...
MFCS
1998
Springer
15 years 3 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 11 months ago
To Feed or Not to Feed Back
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman