Sciweavers

9842 search results - page 1704 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
OOPSLA
2009
Springer
15 years 11 months ago
Scalable nonblocking concurrent objects for mission critical code
The high degree of complexity and autonomy of future robotic space missions, such as Mars Science Laboratory (MSL), poses serious challenges in assuring their reliability and ef...
Damian Dechev, Bjarne Stroustrup
157
Voted
OTM
2009
Springer
15 years 11 months ago
Ontology-Driven Provenance Management in eScience: An Application in Parasite Research
Provenance, from the French word “provenir”, describes the lineage or history of a data entity. Provenance is critical information in scientific applications to verify experime...
Satya Sanket Sahoo, D. Brent Weatherly, Raghava Mu...
ASPDAC
2009
ACM
108views Hardware» more  ASPDAC 2009»
15 years 11 months ago
Synthesis of networks on chips for 3D systems on chips
Three-dimensional stacking of silicon layers is emerging as a promising solution to handle the design complexity and heterogeneity of Systems on Chips (SoCs). Networks on Chips (N...
Srinivasan Murali, Ciprian Seiculescu, Luca Benini...
CSFW
2008
IEEE
15 years 11 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
15 years 11 months ago
A Bayesian approach to empirical local linearization for robotics
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...
« Prev « First page 1704 / 1969 Last » Next »