7015 search results - page 102 / 1403 » Approximation algorithms for co-clustering |
IAT
2006
IEEE
14 years 3 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
CIAC
2006
Springer
14 years 28 days ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
MOC
2000
13 years 9 months ago
2000
The probabilistic approach is used for constructing special layer methods to solve the Cauchy problem for semilinear parabolic equations with small parameter. Despite their probabi...