Sciweavers

3637 search results - page 74 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
CAD
2006
Springer
13 years 9 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
IJSEKE
1998
117views more  IJSEKE 1998»
13 years 8 months ago
An Approach for Adaptive Fault Tolerance in Object-Oriented Open Distributed Systems
Effective fault-handling in emerging complex distributed applications requires the ability to dynamically adapt resource allocation and faulttolerance policies in response to poss...
Eltefaat Shokri, Herbert Hecht, Patrick Crane, Jer...
RECOMB
2006
Springer
14 years 9 months ago
A Study of Accessible Motifs and RNA Folding Complexity
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...
ICECCS
2010
IEEE
162views Hardware» more  ICECCS 2010»
13 years 9 months ago
Trust-Based Adaptation in Complex Service-Oriented Systems
Abstract—Complex networks consisting of humans and software services, such as Web-based social and collaborative environments, typically require flexible and context-based inter...
Florian Skopik, Daniel Schall, Schahram Dustdar
POPL
2003
ACM
14 years 9 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy