Sciweavers

3931 search results - page 252 / 787
» Separation logic and abstraction
Sort
View
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 10 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
DASC
2006
IEEE
16 years 22 days ago
Analysing Stream Authentication Protocols in Autonomous Agent-Based Systems
Abstract— In stream authentication protocols used for largescale data dissemination in autonomuous systems, authentication is based on the timing of the publication of keys, and ...
Mehmet A. Orgun, Ji Ma, Chuchang Liu, Guido Govern...
AI
2002
Springer
15 years 6 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
CSDA
2007
76views more  CSDA 2007»
15 years 6 months ago
Applications of TLS and related methods in the environmental sciences
Rainfall-Runoff and Signal Separation Problems: The process of converting rainfall into runoff is a highly nonlinear problem due to the soil-water interaction that starts when r...
José A. Ramos
MOBICOM
2009
ACM
16 years 1 months ago
SurroundSense: mobile phone localization via ambience fingerprinting
A growing number of mobile computing applications are centered around the user’s location. The notion of location is broad, ranging from physical coordinates (latitude/longitude...
Martin Azizyan, Ionut Constandache, Romit Roy Chou...