Sciweavers

19866 search results - page 370 / 3974
» Computing all factorizations in ***
Sort
View
EOR
2007
99views more  EOR 2007»
15 years 6 months ago
Computing the asymptotic worst-case of bin packing lower bounds
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptoti...
Teodor Gabriel Crainic, Guido Perboli, Miriam Pezz...
TIT
2008
107views more  TIT 2008»
15 years 6 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
IJON
2000
69views more  IJON 2000»
15 years 6 months ago
PARALLEL NEUROSYS: A system for the simulation of very large networks of biologically accurate neurons on parallel computers
We present a software package for the simulation of very large neuronal networks on parallel computers. The package can be run on any system with an implementation of the Message ...
Peter Pacheco, Marcelo Camperi, Toshi Uchino
MLQ
2002
74views more  MLQ 2002»
15 years 6 months ago
Computability on Regular Subsets of Euclidean Space
For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to...
Martin Ziegler
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
15 years 5 months ago
The Computational Structure of Progress Conditions
Abstract. Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n...
Gadi Taubenfeld