Sciweavers

8647 search results - page 84 / 1730
» The Container Selection Problem
Sort
View
127
Voted
WWW
2005
ACM
16 years 3 months ago
On optimal service selection
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
Piero A. Bonatti, P. Festa
108
Voted
PR
2008
131views more  PR 2008»
15 years 2 months ago
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
Salvador García, José Ramón C...
143
Voted
JCSS
2002
199views more  JCSS 2002»
15 years 2 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...
118
Voted
SAT
2005
Springer
133views Hardware» more  SAT 2005»
15 years 8 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
134
Voted
ICVS
2009
Springer
15 years 15 days ago
Automatic Classification of Image Registration Problems
This paper introduces a system that automatically classifies registration problems based on the type of registration required. Rather than rely on a single "best" algorit...
Steve Oldridge, Gregor Miller, Sidney Fels