Sciweavers

2549 search results - page 243 / 510
» Toward a complexity theory of information systems developmen...
Sort
View
APAL
2010
115views more  APAL 2010»
15 years 6 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev
CCS
2010
ACM
15 years 3 months ago
Adjustable autonomy for cross-domain entitlement decisions
Cross-domain information exchange is a growing problem, as business and governmental organizations increasingly need to integrate their information systems with those of partially...
Jacob Beal, Jonathan Webb, Michael Atighetchi
AGP
1999
IEEE
15 years 10 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
BMCBI
2004
174views more  BMCBI 2004»
15 years 5 months ago
Implications for domain fusion protein-protein interactions based on structural information
Background: Several in silico methods exist that were developed to predict protein interactions from the copious amount of genomic and proteomic data. One of these methods is Doma...
Jer-Ming Chia, Prasanna R. Kolatkar
AVI
2008
15 years 7 months ago
Visualizing program similarity in the Ac plagiarism detection system
Programming assignments are easy to plagiarize in such a way as to foil casual reading by graders. Graders can resort to automatic plagiarism detection systems, which can generate...
Manuel Freire