Sciweavers

1560 search results - page 157 / 312
» Order Functions and Evaluation Codes
Sort
View
IANDC
2006
78views more  IANDC 2006»
13 years 10 months ago
A stable programming language
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
Luca Paolini
TCS
2008
13 years 10 months ago
Modeling spiking neural networks
A notation for the functional specification of a wide range of neural networks consisting of temporal or non-temporal neurons, is proposed. The notation is primarily a mathematica...
Ioannis D. Zaharakis, Achilles D. Kameas
IS
2002
13 years 10 months ago
Signature-based structures for objects with set-valued attributes
Aiming at the efficient retrieval of objects with set-valued attributes, we introduce three variations of a new method in order to satisfy subset and superset queries. Our approac...
Eleni Tousidou, Panayiotis Bozanis, Yannis Manolop...
ICC
2007
IEEE
206views Communications» more  ICC 2007»
14 years 4 months ago
Buffer Occupation Probability of Trace-Driven Background Streams in Hybrid Simulation
— In this paper, numerical calculation schemes of the buffer occupation probability for a buffer which is fed by a large number of independent and stationary sources are evaluate...
Ben Lauwens, Bart Scheers, Antoine Van de Capelle
CAV
2006
Springer
133views Hardware» more  CAV 2006»
14 years 2 months ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...