Sciweavers

11808 search results - page 292 / 2362
» Isometries and Computability Structures
Sort
View
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
16 years 23 days 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
ACG
2009
Springer
16 years 18 days ago
Data Assurance in Opaque Computations
The chess endgame is increasingly being seen through the lens of, and therefore effectively defined by, a data ‘model’ of itself. It is vital that such models are clearly faith...
Joe Hurd, Guy Haworth
ECAL
2005
Springer
15 years 11 months ago
A Computational Model of Cellular Morphogenesis in Plants
Plant morphogenesis is the development of plant form and structure by coordinated cell division and growth. We present a dynamic computational model of plant morphogenesis at cellu...
Tim Rudge, Jim Haseloff
ICALP
2005
Springer
15 years 11 months ago
Basic Observables for a Calculus for Global Computing
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribut...
Rocco De Nicola, Daniele Gorla, Rosario Pugliese
ICCS
2005
Springer
15 years 11 months ago
A Computational Risk Assessment Model for Breakwaters
: In the reliability-risk assessment, the second order reliability index method and the Conditional Expectation Monte Carlo (CEMC) simulation were interrelated as a new Level III a...
Can Elmar Balas