Sciweavers

2917 search results - page 136 / 584
» Satisfying Interaction Constraints
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
CAISE
2006
Springer
14 years 1 months ago
Loosely-Coupled Process Automation in Medical Environments
Abstract. We discuss a case study for the hospital scenario where workflow model components are distributed across various computers or devices (e.g. mobile phones, PDAs, sensors, ...
Jurate Vysniauskaite
OOPSLA
1995
Springer
14 years 1 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....
CP
2009
Springer
14 years 10 months ago
Propagator Groups
This paper introduces propagator groups as an abstraction for controlling the execution of propagators as implementations of constraints. Propagator groups enable users of a constr...
Mikael Z. Lagerkvist, Christian Schulte
ICSE
2004
IEEE-ACM
14 years 10 months ago
Heuristic-Based Model Refinement for FLAVERS
FLAVERS is a finite-state verification approach that allows an analyst to incrementally add constraints to improve the precision of the model of the system being analyzed. Except ...
Jianbin Tan, George S. Avrunin, Lori A. Clarke