668 search results - page 104 / 134 » Algorithmics and Applications of Tree and Graph Searching |
141
click to vote
ER
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
115
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
115
click to vote
ADHOCNOW
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting bes...
136
click to vote
SEBD
1997
15 years 3 months ago
1997
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
FPL
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. With the help of the FPGA technology, the boarder between hardand software has vanished. It is now possible to develop complex designs and fine grained parallel applicat...