Sciweavers

691 search results - page 105 / 139
» Non-negative graph embedding
Sort
View
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 1 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
RTCSA
2006
IEEE
14 years 1 months ago
Instruction Scheduling with Release Times and Deadlines on ILP Processors
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
Hui Wu, Joxan Jaffar, Jingling Xue
ICSE
2008
IEEE-ACM
14 years 8 months ago
Clone detection in automotive model-based development
Model-based development is becoming an increasingly common development methodology. In important domains like embedded systems already major parts of the code are generated from m...
Benjamin Hummel, Bernhard Schätz, Elmar J&uum...
ACSAC
2008
IEEE
14 years 2 months ago
STILL: Exploit Code Detection via Static Taint and Initialization Analyses
We propose STILL, a generic defense based on Static Taint and InitiaLization anaLyses, to detect exploit code embedded in data streams/requests targeting at various Internet servi...
Xinran Wang, Yoon-chan Jhi, Sencun Zhu, Peng Liu
CC
2004
Springer
14 years 1 months ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft