2899 search results - page 114 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
102
click to vote
PODS
2008
ACM
16 years 1 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
129
click to vote
SOFSEM
2000
Springer
15 years 5 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
107
click to vote
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
107
click to vote
COR
2006
15 years 1 months ago
2006
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
113
click to vote
ROBOCUP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...