Sciweavers

5101 search results - page 423 / 1021
» Capturing Context Requirements
Sort
View
TASE
2007
IEEE
16 years 1 months ago
Realizing Live Sequence Charts in SystemVerilog
The design of an embedded control system starts with an investigation of properties and behaviors of the process evolving within its environment, and an analysis of the requiremen...
Hai H. Wang, Shengchao Qin, Jun Sun 0001, Jin Song...
CONCUR
2007
Springer
16 years 1 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
SEMWEB
2007
Springer
16 years 1 months ago
Formulation of Hierarchical Task Network Service (De)composition
The Hierarchical Task Network (HTN) planning method is conceived of as a useful method for Web service composition as well as classical task planning. However, there are no complet...
Seiji Koide, Hideaki Takeda
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
16 years 1 months ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert
CIBCB
2006
IEEE
16 years 1 months ago
A Stochastic model to estimate the time taken for Protein-Ligand Docking
Abstract— Quantum mechanics and molecular dynamic simulation provide important insights into structural configurations and molecular interaction data today. To extend this atomi...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...