Sciweavers

1557 search results - page 36 / 312
» What can we do with a Solution
Sort
View
FMCAD
2004
Springer
13 years 11 months ago
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
Orna Grumberg, Assaf Schuster, Avi Yadgar
BMCBI
2006
100views more  BMCBI 2006»
13 years 7 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
ASIACRYPT
2001
Springer
13 years 11 months ago
Secure Human Identification Protocols
One interesting and important challenge for the cryptologic community is that of providing secure authentication and identification for unassisted humans. There are a range of prot...
Nicholas J. Hopper, Manuel Blum
ATAL
2009
Springer
14 years 2 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...
DISCEX
2003
IEEE
14 years 28 days ago
Towards a Rigorous Definition of Information System Survivability
The computer systems that provide the information underpinnings for critical infrastructure applications, both military and civilian, are essential to the operation of those appli...
John C. Knight, Elisabeth A. Strunk, Kevin J. Sull...