Sciweavers

173 search results - page 23 / 35
» A Framework for Proving Contract-Equipped Classes
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
SAS
2005
Springer
114views Formal Methods» more  SAS 2005»
14 years 1 months ago
Type-Safe Optimisation of Plugin Architectures
Programmers increasingly implement plugin architectures in type-safe object-oriented languages such as Java. A virtual machine can dynamically load class files containing plugins,...
Neal Glew, Jens Palsberg, Christian Grothoff
MFCS
2007
Springer
14 years 1 months ago
Evolvability
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...
Leslie G. Valiant
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
13 years 7 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
ARGMAS
2007
Springer
13 years 11 months ago
Arguing and Explaining Classifications
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent knowledge, based on the construction and the comparison of arguments. In this pape...
Leila Amgoud, Mathieu Serrurier