Sciweavers

498 search results - page 62 / 100
» Constraint Answer Set Programming Systems
Sort
View
CCS
2010
ACM
13 years 9 months ago
Input generation via decomposition and re-stitching: finding bugs in Malware
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...
ATAL
2007
Springer
14 years 3 months ago
ARTS: agent-oriented robust transactional system
This paper presents the ARTS (Agent-oriented Robust Transactional System) model, which applies transaction concepts to provide agent developers with high-level support for agent s...
Mingzhong Wang, Amy Unruh, Kotagiri Ramamohanarao
CDC
2010
IEEE
155views Control Systems» more  CDC 2010»
13 years 3 months ago
Relaxing LMI domination matricially
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...
J. William Helton, Igor Klep, Scott A. McCullough
AAI
2007
132views more  AAI 2007»
13 years 9 months ago
Incremental Extraction of Association Rules in Applicative Domains
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...
SIGMOD
2007
ACM
157views Database» more  SIGMOD 2007»
14 years 9 months ago
Compiling mappings to bridge applications and databases
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
Sergey Melnik, Atul Adya, Philip A. Bernstein