1046 search results - page 44 / 210 » Approximation Algorithms for Domination Search |
74
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
Recent progress in Distributed Constraint Optimization Problems (DCOP) has led to a range of algorithms now available which differ in their amount of problem centralization. Probl...
109
Voted
RSA
2002
15 years 2 days ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
94
Voted
JAIR
2007
15 years 10 days ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
108
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...