14165 search results - page 583 / 2833 » The generalized two-server problem |
208
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
200
click to vote
AAAI
2006
15 years 8 months ago
2006
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
197
click to vote
AIPS
2006
15 years 8 months ago
2006
Many scheduling problems are posed as optimization problems where the goal is to find a feasible schedule that maximizes the utilization of some resource. In some domains it is al...
203
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
Next to prediction accuracy, the interpretability of models is one of the fundamental criteria for machine learning algorithms. While high accuracy learners have intensively been e...
185
click to vote
NIPS
2004
15 years 8 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...