1327 search results - page 121 / 266 » Path following algorithm for the graph matching problem |
125
click to vote
AIPS
2010
15 years 4 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
132
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
116
click to vote
WABI
2005
Springer
15 years 7 months ago
2005
Springer
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
136
click to vote
IPSN
2011
Springer
14 years 5 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
111
click to vote
GLOBECOM
2008
IEEE
15 years 3 months ago
2008
IEEE
—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...