1322 search results - page 194 / 265 » Parameterized counting problems |
126
Voted
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
147
Voted
PPPJ
2009
ACM
15 years 10 months ago
2009
ACM
Accelerated graphics cards, or Graphics Processing Units (GPUs), have become ubiquitous in recent years. On the right kinds of problems, GPUs greatly surpass CPUs in terms of raw ...
123
Voted
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
129
Voted
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—This paper presents a technique to perform arbitrary fixed permutations on streaming data. We describe a parameterized architecture that takes as input n data points st...
135
Voted
APPT
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance...