Sciweavers

1161 search results - page 90 / 233
» Approximation schemes for clustering problems
Sort
View
ESWA
2010
105views more  ESWA 2010»
14 years 9 months ago
A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...
Andres Pailla, Athila R. Trindade, Victor Parada, ...
APPROX
2007
Springer
67views Algorithms» more  APPROX 2007»
15 years 6 months ago
Maximum Gradient Embeddings and Monotone Clustering
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
Manor Mendel, Assaf Naor
CORR
1999
Springer
98views Education» more  CORR 1999»
14 years 11 months ago
A variational description of the ground state structure in random satisfiability problems
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
Giulio Biroli, Rémi Monasson, Martin Weigt
HPCA
2001
IEEE
16 years 8 days ago
CARS: A New Code Generation Framework for Clustered ILP Processors
Clustered ILP processors are characterized by a large number of non-centralized on-chip resources grouped into clusters. Traditional code generation schemes for these processors c...
Krishnan Kailas, Kemal Ebcioglu, Ashok K. Agrawala
SIAMIS
2011
14 years 6 months ago
An Upwind Finite-Difference Method for Total Variation-Based Image Smoothing
In this paper we study finite-difference approximations to the variational problem using the BV smoothness penalty that was introduced in an image smoothing context by Rudin, Osh...
Antonin Chambolle, Stacey Levine, Bradley J. Lucie...