Sciweavers

225 search results - page 36 / 45
» Sequential Circuits for Relational Analysis
Sort
View
168
Voted
AAAI
2000
15 years 8 months ago
The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
Vadim V. Anshelevich
ICML
2004
IEEE
16 years 7 months ago
Learning associative Markov networks
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
Benjamin Taskar, Vassil Chatalbashev, Daphne Kolle...
205
Voted
SECON
2007
IEEE
16 years 1 months ago
High-Level Application Development is Realistic for Wireless Sensor Networks
—Programming Wireless Sensor Network (WSN) applications is known to be a difficult task. Part of the problem is that the resource limitations of typical WSN nodes force programm...
Marcin Karpinski, Vinny Cahill
173
Voted
CCS
2007
ACM
16 years 27 days ago
Specifying and analyzing security automata using CSP-OZ
Security automata are a variant of B¨uchi automata used to specify security policies that can be enforced by monitoring system execution. In this paper, we propose using CSP-OZ, ...
David A. Basin, Ernst-Rüdiger Olderog, Paul E...
163
Voted
CISC
2005
Springer
116views Cryptology» more  CISC 2005»
16 years 7 days ago
Specifying Authentication Using Signal Events in CSP
The formal analysis of cryptographic protocols has developed into a comprehensive body of knowledge, building on a wide variety of formalisms and treating a diverse range of securi...
Siraj A. Shaikh, Vicky J. Bush, Steve A. Schneider