Sciweavers

412 search results - page 42 / 83
» A New Proof of the F5 Algorithm
Sort
View
ACL2
2006
ACM
15 years 3 months ago
A SAT-based procedure for verifying finite state machines in ACL2
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
Warren A. Hunt Jr., Erik Reeber
AI
2010
Springer
14 years 6 months ago
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
James Pita, Manish Jain, Milind Tambe, Fernando Or...
CCS
2007
ACM
15 years 4 months ago
Alpaca: extensible authorization for distributed services
Traditional Public Key Infrastructures (PKI) have not lived up to their promise because there are too many ways to define PKIs, too many cryptographic primitives to build them wi...
Chris Lesniewski-Laas, Bryan Ford, Jacob Strauss, ...
TLCA
2005
Springer
15 years 3 months ago
Privacy in Data Mining Using Formal Methods
There is growing public concern about personal data collected by both private and public sectors. People have very little control over what kinds of data are stored and how such da...
Stan Matwin, Amy P. Felty, István T. Hern&a...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau