Sciweavers

466 search results - page 83 / 94
» Fundamental Complexity of Optical Systems
Sort
View
CASES
2008
ACM
13 years 10 months ago
Efficiency and scalability of barrier synchronization on NoC based many-core architectures
Interconnects based on Networks-on-Chip are an appealing solution to address future microprocessor designs where, very likely, hundreds of cores will be connected on a single chip...
Oreste Villa, Gianluca Palermo, Cristina Silvano
RTAS
2008
IEEE
14 years 2 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
W2GIS
2004
Springer
14 years 1 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
IM
2003
13 years 9 months ago
Facilitating Efficient and Reliable Monitoring through HAMSA
: Monitoring is a fundamental building block of any network management system. It is needed to ensure that the network operates within the required parameters, and to account for u...
David Breitgand, Danny Dolev, Danny Raz, Gleb Shav...
RE
2010
Springer
13 years 2 months ago
Effort and Quality of Recovering Requirements-to-Code Traces: Two Exploratory Experiments
Trace links between requirements and code are essential for many software development and maintenance activities. Despite significant advances in traceability research, creating li...
Alexander Egyed, Florian Graf, Paul Grünbache...