1441 search results - page 167 / 289 » Multiple instance ranking |
WEA
2009
Springer
15 years 4 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
We address a large scale waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and drivers lunch breaks. A fitness search spac...
DSN
2008
IEEE
15 years 4 months ago
2008
IEEE
Soft state in the middle tier is key to enabling scalable and responsive three tier service architectures. While softstate can be reconstructed upon failure, replicating it across...
109
click to vote
SLS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
CRV
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper presents the groundwork for a distributed network of collaborating, intelligent surveillance cameras, implemented with low-cost embedded microprocessor camera modules. ...