7015 search results - page 277 / 1403 » Approximation algorithms for co-clustering |
195
click to vote
STACS
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
293
click to vote
ATAL
2005
Springer
16 years 3 days ago
2005
Springer
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
189
click to vote
COMPGEOM
2000
ACM
15 years 11 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
173
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
165
Voted
OPODIS
2008
15 years 8 months ago
2008
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...