Sciweavers

12015 search results - page 476 / 2403
» Interactive Algorithms 2005
Sort
View
EUROPAR
2005
Springer
15 years 10 months ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo
241
Voted
MEMBRANE
2005
Springer
15 years 10 months ago
Boolean Circuits and a DNA Algorithm in Membrane Computing
In the present paper we propose a way to simulate Boolean gates and circuits in the framework of P systems with active membranes using inhibiting/de-inhibiting rules. This new appr...
Mihai Ionescu, Tseren-Onolt Ishdorj
TES
2005
Springer
15 years 10 months ago
SENECA - Simulation of Algorithms for the Selection of Web Services for Compositions
This paper discusses a combinatorial problem about the selection of candidates for Web service compositions. The problem occurs if we assume that a discovery process has identifi...
Michael C. Jaeger, Gregor Rojec-Goldmann
BMCBI
2005
110views more  BMCBI 2005»
15 years 4 months ago
Considerations when using the significance analysis of microarrays (SAM) algorithm
Background: Users of microarray technology typically strive to use universally acceptable data analysis strategies to determine significant expression changes in their experiments...
Ola Larsson, Claes Wahlestedt, James A. Timmons
HRI
2006
ACM
15 years 10 months ago
A model for imitating human reaching movements
We present a model of human-like reaching movements. This model is then used to give a humanoid robot the ability to imitate human reaching motions. It illustrates that having a r...
Micha Hersch, Aude Billard