Sciweavers

15033 search results - page 244 / 3007
» Complexity Theory and Algorithms
Sort
View
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
15 years 9 months ago
On the Complexity of #CSP
Martin Dyer and David Richerby
IWOCA
2009
Springer
112views Algorithms» more  IWOCA 2009»
15 years 9 months ago
The Guarding Problem - Complexity and Approximation
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
130
Voted
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 11 months ago
Solving the MAXSAT problem using a multivariate EDA based on Markov networks
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
Alexander E. I. Brownlee, John A. W. McCall, Deryc...
PODC
2005
ACM
15 years 10 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
GIS
2006
ACM
15 years 4 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe