Timisoara, September 26-29, 2008. Deadline: June 10. Details: http://synasc08.info.uvt.ro/

Details: http://www.summerschools.ro

http://www.guardian.co.uk/science/2008/may/12/peopleinscience.religion

In [Istrate, Marathe, Ravi SODA 2001] we advocated the investigation of robustness of results in the theory of learning in games under adversarial scheduling models. We provide evidence that such an analysis is feasible and can lead to nontrivial results by investigating, in an adversarial scheduling setting, Peyton Young's model of diffusion of norms. In particular, our main result incorporates contagion into Peyton Young's model. A preliminary

The Centre for Higher Education Development (CHE), a German think-tank for higher education has developed a "Ranking of Excellent European Graduate Programmes in Natural Sciences and Mathematics", available at http://www.che.de/downloads/CHE_ExcellenceRanking_AP99.pdf The report does not appear to include any reference to Romania.

http://www.thediplomat.ro/reports_1207.php

Detalii complete: http://www.fundatiadinupatriciu.ro/?section=10 (sursa prezentarii de mai jos). Programul Orizonturi Deschise se adresează acelor tineri care doresc să-şi desăvârşească formaţia intelectuală şi profesională prin programe de master sau doctorat în universităţi prestigioase ale lumii, dar care, din motive financiare, nu îşi pot duce singuri visul la îndeplinire. Fundaţia Dinu Patriciu vine în întâmpinarea acestor

The distribution of overlaps of solutions of a random CSP is an indicator of the overall geometry of its solution space. For random $k$-SAT, nonrigorous methods from Statistical Physics support the validity of the ``one step replica symmetry breaking'' approach. Some of these predictions were rigorously confirmed in cite{cond-mat/0504070/prl} cite{cond-mat/0506053}. There it is proved that the overlap distribution of random $k$-SAT, $kgeq 9$, has

Packet reordering is an important property of network traffic that should be captured by analytical models of the Transmission Control Protocol (TCP). We study a combinatorial problem motivated by RESTORED, a TCP modeling methodology that incorporates information about packet dynamics. A significant component of this model is a many-to-one mapping $B$ that transforms sequences of packet IDs into buffer sequences, in a manner that is compatible with

http://www.summerschools.ro