Sciweavers

1760 search results - page 332 / 352
» Program Analysis Using Weighted Pushdown Systems
Sort
View
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 9 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
TSMC
1998
96views more  TSMC 1998»
13 years 9 months ago
The MDS-ANAVA technique for assessing knowledge representation differences between skill groups
—Knowledge representation is one of important factors that determine human performance on cognitive tasks. Due to different levels of experience, different groups of people may d...
Nong Ye
SCP
2010
78views more  SCP 2010»
13 years 8 months ago
Scoping strategies for distributed aspects
Dynamic deployment of aspects brings greater flexibility and reuse potential, but requires a proper means for scoping aspects. Scoping issues are particularly crucial in a distri...
Éric Tanter, Johan Fabry, Rémi Douen...
TII
2010
124views Education» more  TII 2010»
13 years 4 months ago
Address-Independent Estimation of the Worst-case Memory Performance
Abstract--Real-time systems are subject to temporal constraints and require a schedulability analysis to ensure that task execution finishes within lower and upper specified bounds...
Basilio B. Fraguela, Diego Andrade, Ramon Doallo
CASES
2006
ACM
14 years 3 months ago
Adaptive and flexible dictionary code compression for embedded applications
Dictionary code compression is a technique where long instructions in the memory are replaced with shorter code words used as index in a table to look up the original instructions...
Mats Brorsson, Mikael Collin