Sciweavers

4095 search results - page 466 / 819
» How to test a tree
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
16 years 6 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
ICSE
2009
IEEE-ACM
16 years 21 days ago
Improving quality, one process change at a time
We report on one organization's experience making process changes in a suite of projects. The changes were motivated by clients’ requests for better time estimates, better ...
Caryna Pinheiro, Frank Maurer, Jonathan Sillito
CIDM
2009
IEEE
16 years 21 days ago
A new hybrid method for Bayesian network learning With dependency constraints
Abstract— A Bayes net has qualitative and quantitative aspects: The qualitative aspect is its graphical structure that corresponds to correlations among the variables in the Baye...
Oliver Schulte, Gustavo Frigo, Russell Greiner, We...
IAT
2009
IEEE
16 years 20 days ago
Simulating BDI-Based Wireless Sensor Networks
—“Autonomic systems” merge advancements in the field of multi-agent software design, dynamic analysis, and decentralized control in order to assist designers in constructing...
Alexis Morris, Paolo Giorgini, Sameh Abdel-Naby
SAT
2009
Springer
126views Hardware» more  SAT 2009»
16 years 14 days ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia