417 search results - page 37 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
JPDC
2006
13 years 8 months ago
2006
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
GECCO
2006
Springer
14 years 4 days ago
2006
Springer
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
IDA
1997
Springer
14 years 19 days ago
1997
Springer
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...