1346 search results - page 74 / 270 » Algorithmic Search for Flexibility Using Resultants of Polyn... |
ALGORITHMICA
2005
13 years 8 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
GLOBECOM
2007
IEEE
13 years 9 months ago
2007
IEEE
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
IPM
2006
13 years 9 months ago
2006
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
JDCTA
2010
13 years 3 months ago
2010
The paper presents an algorithm which combining a neural network observer, it give more flexible and accurate control on the engine operation. In recent year, several researchers ...