3875 search results - page 556 / 775 » Approximation algorithms for the 0-extension problem |
173
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
175
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
191
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
205
click to vote
INFORMS
1998
15 years 6 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
188
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...