2738 search results - page 84 / 548 » The Frobenius Problem and Its Generalizations |
SIAMDM
2010
14 years 8 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
OPODIS
2008
14 years 11 months ago
2008
We study the group renaming problem, which is a natural generalization of the renaming problem. An instance of this problem consists of n processors, partitioned into m groups, ea...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
100
click to vote
AAAI
2012
13 years 7 days ago
2012
Planning is vital to a wide range of domains, including robotics, military strategy, logistics, itinerary generation and more, that both humans and computers find difficult. Col...