6315 search results - page 153 / 1263 » Approximating Solution Structure |
152
click to vote
WSC
2007
15 years 8 months ago
2007
There has long been a competition between simulation and optimization in the modeling of problems in transportation and logistics, machine scheduling and similar highdimensional p...
169
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attri...
185
click to vote
PPL
2010
15 years 1 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
217
click to vote
WADS
2007
Springer
16 years 16 days ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
140
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...