Sciweavers

1022 search results - page 97 / 205
» The Modelling of Embedded Systems Using HASoC
Sort
View
SPAA
2004
ACM
14 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
COCOA
2008
Springer
13 years 12 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati
DLS
2010
277views Languages» more  DLS 2010»
13 years 8 months ago
Factor: a dynamic stack-based programming language
Factor is a new dynamic object-oriented programming language. It began as an embedded scripting language and evolved to a mature application development language. The language has...
Sviatoslav Pestov, Daniel Ehrenberg, Joe Groff
CASES
2006
ACM
14 years 1 months ago
State space reconfigurability: an implementation architecture for self modifying finite automata
Many embedded systems exhibit temporally and behaviorally disjoint behavior slices. When such behaviors are captured by state machines, the current design flow will capture it as ...
Ka-Ming Keung, Akhilesh Tyagi
FUIN
2006
160views more  FUIN 2006»
13 years 10 months ago
Behavioral Pattern Identification Through Rough Set Modeling
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...
Jan G. Bazan