Sciweavers

67 search results - page 9 / 14
» Positive Grammar Checking: A Finite State Approach
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Bounded model checking knowledge and branching time in synchronous multi-agent systems
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
Xiangyu Luo, Kaile Su, Abdul Sattar, Qingliang Che...
ICRA
2009
IEEE
144views Robotics» more  ICRA 2009»
14 years 2 months ago
Clothes state recognition using 3D observed data
Abstract— In this paper, we propose a deformable-modeldriven method to recognize the state of hanging clothes using three-dimensional (3D) observed data. For the task to pick up ...
Yasuyo Kita, Toshio Ueshiba, Ee Sian Neo, Nobuyuki...
EUMAS
2006
13 years 9 months ago
A Metamodel for Verifying Institutions
To investigate the interdependencies existing among deontic positions (like powers and obligations) and the ontology defined by an institution, we have proposed to model instituti...
Francesco Viganò
ANLP
2000
124views more  ANLP 2000»
13 years 8 months ago
A Divide-and-Conquer Strategy for Shallow Parsing of German Free Texts
We present a divide-and-conquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sente...
Günter Neumann, Christian Braun, Jakub Piskor...
SP
2010
IEEE
157views Security Privacy» more  SP 2010»
13 years 11 months ago
Bootstrapping Trust in Commodity Computers
Trusting a computer for a security-sensitive task (such as checking email or banking online) requires the user to know something about the computer’s state. We examine research ...
Bryan Parno, Jonathan M. McCune, Adrian Perrig