Sciweavers

223 search results - page 2 / 45
» Mixed partitions and related designs
Sort
View
CODES
2003
IEEE
13 years 11 months ago
Design optimization of mixed time/event-triggered distributed embedded systems
Distributed embedded systems implemented with mixed, eventtriggered and time-triggered task sets, which communicate over bus protocols consisting of both static and dynamic phases...
Traian Pop, Petru Eles, Zebo Peng
COLT
2001
Springer
13 years 10 months ago
Tracking a Small Set of Experts by Mixing Past Posteriors
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
Olivier Bousquet, Manfred K. Warmuth
CAV
1994
Springer
73views Hardware» more  CAV 1994»
13 years 9 months ago
A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design ...
Insup Lee, Sanguthevar Rajasekaran
TPDS
1998
71views more  TPDS 1998»
13 years 5 months ago
Parallel Algorithms for Relational Coarsest Partition Problems
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
Sanguthevar Rajasekaran, Insup Lee
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
13 years 9 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...