224 search results - page 2 / 45 » The Complexity of Finding Replicas Using Equality Tests |
AIPS
2008
13 years 7 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
ICANN
2001
Springer
13 years 9 months ago
2001
Springer
A network of relaxation oscillators is used to find downbeats in rhythmical patterns. In this study, a novel model is described in detail. Its behavior is tested by exposing it to...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
ICCCN
2007
IEEE
13 years 11 months ago
2007
IEEE
—This paper focuses on the use of specific interleaving techniques for use in W-CDMA (Wideband Code Division Multiple Access). The linear equalization algorithm usually performs ...
EUROSYS
2011
ACM
12 years 8 months ago
2011
ACM
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...