Sciweavers

5111 search results - page 287 / 1023
» The Embedded Systems Design Challenge
Sort
View
SPAA
2004
ACM
16 years 3 days 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
AOSD
2011
ACM
15 years 1 months ago
Aspect-aware operating system development
The domain of operating systems has often been mentioned as an “ideal candidate” for the application of AOP; fundamental policies we find in these systems, such as synchroniz...
Daniel Lohmann, Wanja Hofer, Wolfgang Schröde...
SWARM
2008
SPRINGER
108views Optimization» more  SWARM 2008»
15 years 6 months ago
A framework of space-time continuous models for algorithm design in swarm robotics
Designing and analyzing self-organizing systems such as robotic swarms is a challenging task even though we have complete knowledge about the robot's interior. It is difficul...
Heiko Hamann, Heinz Wörn
MODELS
2009
Springer
16 years 1 months ago
Evaluating Context Descriptions and Property Definition Patterns for Software Formal Validation
A well known challenge in the formal methods domain is to improve their integration with practical engineering methods. In the context of embedded systems, model checking requires ...
Philippe Dhaussy, Pierre Yves Pillain, Stephen Cre...
SBCCI
2006
ACM
200views VLSI» more  SBCCI 2006»
16 years 19 days ago
REDEFIS: a system with a redefinable instruction set processor
The growing complexity and production cost of processor-based systems have imposed big constraints in SoC design of new systems. GPPs and ASICs are unable to fit the tight perform...
Victor M. Goulart Ferreira, Lovic Gauthier, Takayu...