This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to the sizes of optimal constant-weight, binary, error-correcting codes, and evaluate the differences. A preliminary version can be read from http://xxx.lanl.gov/abs/cs.OH/9906001

This Santa Fe Institute volume is intended to be a standard reference to statistical physics methods in computer science theory, particularly in relation to the study of phase transitions in combinatorial problems. It will contain both basic pedagogical material and technical tips and discussions to review the field from a broad perspective. The study of phase transitions in combinatorial problems originated about 50 years ago in work on random graphs

We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network. A preliminary version is freely available from http://www.win.tue.nl/~sthite/pubs/d2ec-fawn06.pdf The list of authors, as presented on the publishers' website below

We compute the probability of satisfiability of a class of random Horn-SAT formulae, motivated by a connection with the nonemptiness problem of finite tree automata. In particular, when the maximum clause length is 3, this model displays a curve in its parameter space along which the probability of satisfiability is discontinuous, ending in a second-order phase transition where it becomes continuous. This is the first case in which a phase transition

Data limita pentru trimiterea lucrarilor 20 iunie. Detalii la http://synasc05.info.uvt.ro/

http://www.econ.complexity.ase.ro/

http://europa.eu.int/comm/research/press/2005/pr0704-2en.cfm

http://www.imar.ro/~sergium/erg.html

March 23rd 2005. Details: http://www.premii-tic.ro

http://www.ac.utt.ro/conferinte/saci2005/saci2005.html