221 search results - page 23 / 45 » New formulations for the Kissing Number Problem |
72
Voted
AI
2000
Springer
14 years 9 months ago
2000
Springer
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Evidence suggests that credal ...
76
Voted
DAM
2008
14 years 9 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
SIAMIS
2008
14 years 9 months ago
2008
This paper introduces a new approach to the problem of quantitative reconstruction of an object from few radiographic views. A mixed variable programming problem is formulated in ...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
90
Voted
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
The rapid advances of genome-scale sequencing have brought out the necessity of developing new data processing techniques for enormous genomic data. Microarrays, for example, can g...