Sciweavers

1568 search results - page 301 / 314
» The problem of examination questions in algorithmics
Sort
View
ICCS
2004
Springer
14 years 24 days ago
Petri Nets as Executable Specifications of High-Level Timed Parallel Systems
We propose to use high-level Petri nets as a model for the semantics of high-level parallel systems. This model is known to be useful for the purpose of verification and we show t...
Franck Pommereau
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 8 days ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
14 years 6 days ago
Evolving the placement and density of neurons in the hyperneat substrate
The Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT) approach demonstrated that the pattern of weights across the connectivity of an artificial neural network ...
Sebastian Risi, Joel Lehman, Kenneth O. Stanley
CIKM
2009
Springer
14 years 1 days ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
ESWS
2010
Springer
13 years 11 months ago
Scalable and Parallel Reasoning in the Semantic Web
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
Jacopo Urbani