221 search results - page 21 / 45 » New formulations for the Kissing Number Problem |
ICRA
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper we deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delay...
76
Voted
DAC
1997
ACM
15 years 1 months ago
1997
ACM
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
ISSAC
1995
Springer
15 years 1 months ago
1995
Springer
In this paper the programs APPLYSYM, QUASILINPDE and DETRAFO are described which aim at the utilization of infinitesimal symmetries of differential equations. The purpose of QUA...
ICMLA
2008
14 years 11 months ago
2008
In this paper, we introduce two new formulations for multi-class multi-kernel relevance vector machines (mRVMs) that explicitly lead to sparse solutions, both in samples and in nu...
IJCAI
1997
14 years 11 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...