Sciweavers

3218 search results - page 14 / 644
» Timed Extensions for SDL
Sort
View
APIN
2005
94views more  APIN 2005»
13 years 8 months ago
Extension of Petri Nets for Representing and Reasoning with Tasks with Imprecise Durations
This paper presents an extension of Petri net framework with imprecise temporal properties. We use possibility theory to represent imprecise time by time-stamping tokens and assig...
Stanislav Kurkovsky, Rasiah Loganantharaj
FLAIRS
2003
13 years 10 months ago
An Extension of the Differential Approach for Bayesian Network Inference to Dynamic Bayesian Networks
We extend the differential approach to inference in Bayesian networks (BNs) (Darwiche, 2000) to handle specific problems that arise in the context of dynamic Bayesian networks (D...
Boris Brandherm
POPL
2008
ACM
14 years 9 months ago
Extensible encoding of type hierarchies
The subtyping test consists of checking whether a type t is a descendant of a type r (Agrawal et al. 1989). We study how to perform such a test efficiently, assuming a dynamic hie...
Hamed Seiied Alavi, Seth Gilbert, Rachid Guerraoui
DATE
2008
IEEE
110views Hardware» more  DATE 2008»
14 years 3 months ago
Run-time System for an Extensible Embedded Processor with Dynamic Instruction Set
One of the upcoming challenges in embedded processing is to incorporate an increasing amount of adaptivity in order to respond to the multifarious constraints induced by today’s...
Lars Bauer, Muhammad Shafique, Stephanie Kreutz, J...
ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...