Sciweavers

14382 search results - page 195 / 2877
» Time in Connectionist Models
Sort
View
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
15 years 10 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
WSC
2007
15 years 8 months ago
Optimizing time warp simulation with reinforcement learning techniques
Adaptive Time Warp protocols in the literature are usually based on a pre-defined analytic model of the system, expressed as a closed form function that maps system state to cont...
Jun Wang, Carl Tropper
WSC
2004
15 years 7 months ago
Approximate Time-Parallel Cache Simulation
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...
Tobias Kiesling
ICDE
2008
IEEE
110views Database» more  ICDE 2008»
16 years 7 months ago
InstantDB: Enforcing Timely Degradation of Sensitive Data
- People cannot prevent personal information from being collected by various actors. Several security measures are implemented on servers to minimize the possibility of a privacy v...
Nicolas Anciaux, Luc Bouganim, Harold van Heerde, ...
ISORC
2009
IEEE
16 years 1 months ago
Marte CCSL to Execute East-ADL Timing Requirements
In the automotive domain, several loosely-coupled Architecture Description Languages (ADLs) compete to proet of abstract modeling and analysis services on top of the implementatio...
Frédéric Mallet, Marie-Agnès ...