Sciweavers

2702 search results - page 380 / 541
» Requirements Processes: An Experience Report
Sort
View
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 11 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
RTAS
1999
IEEE
15 years 11 months ago
Timing Constraint Remapping to Avoid Time Discontinuities in Distributed Real-Time Systems
In this paper we propose a dynamic constraint transformation technique for ensuring timing requirements in a distributed real-time system possessing periodically synchronized dist...
Minsoo Ryu, Jungkeun Park, Seongsoo Hong
ROBOCUP
1999
Springer
115views Robotics» more  ROBOCUP 1999»
15 years 11 months ago
UBU Team
The underlying research topics and the architecture of the UBU team are briefly described. The aim of developing UBU is to subject a series of tools and procedures for agent decis...
Johan Kummeneje, David Lybäck, Håkan L....
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
15 years 10 months ago
Discovering frequent patterns in sensitive data
Discovering frequent patterns from data is a popular exploratory technique in data mining. However, if the data are sensitive (e.g. patient health records, user behavior records) ...
Raghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhr...
VLDB
2000
ACM
129views Database» more  VLDB 2000»
15 years 10 months ago
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
Chris Olston, Jennifer Widom