Sciweavers

337 search results - page 65 / 68
» Semidefinite Programming Based Approximation Algorithms
Sort
View
MOBIQUITOUS
2007
IEEE
14 years 1 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
BMCBI
2008
140views more  BMCBI 2008»
13 years 7 months ago
Improved accuracy of multiple ncRNA alignment by incorporating structural information into a MAFFT-based framework
Background: Structural alignment of RNAs is becoming important, since the discovery of functional non-coding RNAs (ncRNAs). Recent studies, mainly based on various approximations ...
Kazutaka Katoh, Hiroyuki Toh
CASES
2003
ACM
13 years 11 months ago
A hierarchical approach for energy efficient application design using heterogeneous embedded systems
Several features such as reconfiguration, voltage and frequency scaling, low-power operating states, duty-cycling, etc. are exploited for latency and energy efficient application ...
Sumit Mohanty, Viktor K. Prasanna
VMCAI
2004
Springer
14 years 25 days ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
PDCN
2004
13 years 8 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer