Sciweavers

8766 search results - page 1576 / 1754
» Functional logic programming
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
15 years 3 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
BMCBI
2007
144views more  BMCBI 2007»
15 years 3 months ago
Accelerated search for biomolecular network models to interpret high-throughput experimental data
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...
Suman Datta, Bahrad A. Sokhansanj
IJFCS
2006
130views more  IJFCS 2006»
15 years 3 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
CSI
2007
89views more  CSI 2007»
15 years 3 months ago
Writing and executing ODP computational viewpoint specifications using Maude
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
José Raúl Romero, Antonio Vallecillo...
ECCC
2007
90views more  ECCC 2007»
15 years 3 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
« Prev « First page 1576 / 1754 Last » Next »