Sciweavers

606 search results - page 48 / 122
» Complexity Results for Checking Distributed Implementability
Sort
View
CW
2005
IEEE
15 years 5 months ago
Agent Models for Dynamic 3D Virtual Worlds
Agents are systems capable of perceiving their environment through sensors, reasoning about their sensory input using some characteristic reasoning process and acting in their env...
Mary Lou Maher, Kathryn Elizabeth Merrick
EMSOFT
2004
Springer
15 years 5 months ago
Exploiting prescriptive aspects: a design time capability
Aspect oriented programming (AOP), when used well, has many advantages. Aspects are however, programming-time constructs, i.e., they relate to source code. Previously, we develope...
John A. Stankovic, Prashant Nagaraddi, Zhendong Yu...
DAC
2009
ACM
16 years 24 days ago
Computing bounds for fault tolerance using formal techniques
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
André Sülflow, Görschwin Fey, Rol...
CORR
2002
Springer
135views Education» more  CORR 2002»
14 years 11 months ago
Minimal-Change Integrity Maintenance Using Tuple Deletions
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are li...
Jan Chomicki, Jerzy Marcinkowski
DGCI
2005
Springer
15 years 5 months ago
Algorithms for the Topological Watershed
The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,9] consists in modifying the original image by lowering...
Michel Couprie, Laurent Najman, Gilles Bertrand