1327 search results - page 244 / 266 » Path following algorithm for the graph matching problem |
127
click to vote
INFOCOM
2010
IEEE
15 years 3 days ago
2010
IEEE
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
133
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
112
click to vote
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
139
Voted
BMCBI
2011
14 years 5 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
126
click to vote
CCCG
2008
15 years 3 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...