Sciweavers

248 search results - page 6 / 50
» The Multi-Story Space Assignment Problem
Sort
View
COMBINATORICS
1998
79views more  COMBINATORICS 1998»
13 years 8 months ago
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
Ljiljana Brankovic, Mirka Miller, Ján Plesn...
JCSS
2002
199views more  JCSS 2002»
13 years 8 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
13 years 1 days ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
HAIS
2010
Springer
14 years 1 months ago
Hybrid Color Space Transformation to Visualize Color Constancy
Abstract. Color constancy and chromatic edge detection are fundamental problems in artificial vision. In this paper1 we present a way to provide a visualization of color constancy...
Ramón Moreno, José Manuel Lóp...
SOFSEM
2004
Springer
14 years 1 months ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...