7930 search results - page 222 / 1586 » Greedy in Approximation Algorithms |
140
click to vote
IJCAI
2007
15 years 8 months ago
2007
We introduce a weakening of standard gametheoretic dominance conditions, called δdominance, which enables more aggressive pruning of candidate strategies at the cost of solution ...
171
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...
188
click to vote
UAI
2008
15 years 8 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...