Sciweavers

920 search results - page 62 / 184
» Computing the Frequency of Partial Orders
Sort
View
FPL
2010
Springer
134views Hardware» more  FPL 2010»
14 years 7 months ago
GPU Versus FPGA for High Productivity Computing
Heterogeneous or co-processor architectures are becoming an important component of high productivity computing systems (HPCS). In this work the performance of a GPU based HPCS is c...
David Huw Jones, Adam Powell, Christos-Savvas Boug...
ATAL
2004
Springer
15 years 3 months ago
Communication for Improving Policy Computation in Distributed POMDPs
Distributed Partially Observable Markov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to joi...
Ranjit Nair, Milind Tambe, Maayan Roth, Makoto Yok...
SPIN
2009
Springer
15 years 4 months ago
Improving Non-Progress Cycle Checks
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
David Faragó, Peter H. Schmitt
SEMWEB
2010
Springer
14 years 7 months ago
Using SPARQL to Test for Lattices: Application to Quality Assurance in Biomedical Ontologies
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...
Guo-Qiang Zhang, Olivier Bodenreider
COLING
2010
14 years 4 months ago
Kernel Slicing: Scalable Online Training with Conjunctive Features
This paper proposes an efficient online method that trains a classifier with many conjunctive features. We employ kernel computation called kernel slicing, which explicitly consid...
Naoki Yoshinaga, Masaru Kitsuregawa