Sciweavers

16430 search results - page 819 / 3286
» On Computable Tree Functions
Sort
View
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
16 years 2 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol
MEMBRANE
2009
Springer
16 years 2 months ago
Computational Nature of Processes Induced by Biochemical Reactions
evel of abstraction that we adopt, the functioning of a biochemical reaction is based on facilitation and inhibition: a reaction can take place if all of its reactants are present ...
Andrzej Ehrenfeucht, Grzegorz Rozenberg
CCGRID
2008
IEEE
16 years 2 months ago
Overlapping Communication and Computation with High Level Communication Routines
Collective operations and non-blocking point-to-point operations are two important parts of MPI that each provide important performance and programmability benefits. Although non...
Torsten Hoefler, Andrew Lumsdaine
PERCOM
2008
ACM
16 years 1 months ago
An Autonomic Context Management System for Pervasive Computing
Abstract—Context-aware applications adapt to changing computing environments or changing user circumstances/tasks. Context information that supports such adaptations is provided ...
Peizhao Hu, Jadwiga Indulska, Ricky Robinson
IAT
2007
IEEE
16 years 1 months ago
A Computational Model for Adaptive Emotion Regulation
Emotion regulation describes how a subject can use certain strategies to affect emotion response levels. Usually, models for emotion regulation assume mechanisms based on feedback ...
Tibor Bosse, Matthijs Pontier, Jan Treur