701 search results - page 123 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
129
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
101
Voted
AGILE
2009
Springer
15 years 10 months ago
2009
Springer
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
126
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
This paper studies the problem of unified ranked retrieval of heterogeneous XML documents and Web data. We propose an effective search engine called Sailer to adaptively and versa...
199
click to vote
FOCS
1997
IEEE
15 years 7 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
118
Voted
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...