4325 search results - page 332 / 865 » Incremental computation with names |
152
click to vote
SCM
2003
15 years 8 months ago
2003
Abstract. Motivated by our work on object-oriented Content Management, this paper proposes an extensible formal framework for delta and merging strategies, each applicable to a spe...
144
click to vote
APAL
2007
15 years 7 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
170
click to vote
DEDS
2006
15 years 6 months ago
2006
A class of time-varying discrete-event systems, named dynamic discrete-event systems, is defined. The goal of this paper is to provide a method which is modular and can be applied ...
184
click to vote
IJFCS
2008
15 years 6 months ago
2008
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event s...
135
click to vote
IJON
2006
15 years 6 months ago
2006
In this paper we revisit a classic HOS-based BSS criterion, namely the maximization of the higher-order moments of the estimated sources. The main contributions of this paper are:...