Sciweavers

828 search results - page 75 / 166
» Bounded Hairpin Completion
Sort
View
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
14 years 4 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
EUC
2007
Springer
14 years 4 months ago
Consensus-Driven Distributable Thread Scheduling in Networked Embedded Systems
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
Jonathan Stephen Anderson, Binoy Ravindran, E. Dou...
EUC
2007
Springer
14 years 4 months ago
Assured-Timeliness Integrity Protocols for Distributable Real-Time Threads with in Dynamic Distributed Systems
Networked embedded systems present unique challenges for system designers composing distributed applications with dyanmic, real-time, and resilience requirements. We consider the ...
Binoy Ravindran, Edward Curley, Jonathan Stephen A...
RTAS
2006
IEEE
14 years 4 months ago
Estimating the Worst-Case Energy Consumption of Embedded Software
The evolution of battery technology is not being able to keep up with the increasing performance demand of mobile embedded systems. Therefore, battery life has become an important...
Ramkumar Jayaseelan, Tulika Mitra, Xianfeng Li
APLAS
2005
ACM
14 years 3 months ago
Calculating Polynomial Runtime Properties
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and ...
Hugh Anderson, Siau-Cheng Khoo, Stefan Andrei, Bea...