Sciweavers

749 search results - page 75 / 150
» Combinatory Models and Symbolic Computation
Sort
View
FOCS
1992
IEEE
15 years 4 months ago
Quadratic Dynamical Systems (Preliminary Version)
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
Yuri Rabinovich, Alistair Sinclair, Avi Wigderson
JMLR
2006
145views more  JMLR 2006»
14 years 12 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
DCC
2006
IEEE
15 years 11 months ago
Low-Complexity Compression of Short Messages
We describe a low-complexity scheme for lossless compression of short text messages. The method uses arithmetic coding and a specific statistical context model for prediction of s...
Stephan Rein, Clemens Gühmann, Frank H. P. Fi...
SMA
2005
ACM
104views Solid Modeling» more  SMA 2005»
15 years 5 months ago
Packing a trunk: now with a twist!
In an industry project with a German car manufacturer we are faced with the challenge of placing a maximum number of uniform rigid rectangular boxes in the interior of a car trunk...
Friedrich Eisenbrand, Stefan Funke, Andreas Karren...
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
14 years 3 months 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