1046 search results - page 162 / 210 » Approximation Algorithms for Domination Search |
125
Voted
STOC
2001
ACM
16 years 2 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
131
Voted
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
130
click to vote
ENC
2005
IEEE
15 years 8 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
136
Voted
ISMIR
2000
Springer
15 years 6 months ago
2000
Springer
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...
130
click to vote
RTSS
1992
IEEE
15 years 6 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...