1327 search results - page 111 / 266 » Path following algorithm for the graph matching problem |
107
click to vote
KCAP
2003
ACM
15 years 7 months ago
2003
ACM
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
102
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
108
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
ICALP
2009
Springer
15 years 8 months ago
2009
Springer
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
135
click to vote
4OR
2010
15 years 8 days ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...