Software-generated paper accepted at IEEE Conference
http://entertainment.slashdot.org/article.pl?sid=08/12/23/2321242
Read moreScopul nostru este sprijinirea şi promovarea cercetării ştiinţifice şi facilitarea comunicării între cercetătorii români din întreaga lume.
http://entertainment.slashdot.org/article.pl?sid=08/12/23/2321242
Read morehttp://www.observatorcultural.ro/BIFURCATII.-ISI*articleID_20846-articles_details.html
Read moreWe study nondeterministic and probabilistic versions of a discrete dynamical system (due to T. Antal, P. L. Krapivsky, and S. Redner) inspired by Heider's social balance theory. We investigate the convergence time of this dynamics on several classes of graphs. Our contributions include: 1. We point out the connection between the triad dynamics and a generalization of annihilating walks to hypergraphs. In particular, this connection allows us to completely
Read moreThe mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over sparse random graphs, the phase structure of the graph bisection problem displays certain familiar properties, but also some surprises. It is known that when the mean degree is below the critical value of 2 log 2, the
Read morehttp://jeruccs2008.org/node/672
Read morehttp://www.plosone.org/article/info:doi/10.1371/journal.pone.0001683
Read morehttp://scitation.aip.org/journals/doc/PHTOAD-ft/vol_58/iss_9/43_1.shtml
Read moreWe describe the scope of Adversarial Scheduling Analysis, an approach to validating game-theoretic models and Social Simulations. We discuss a couple of examples showing that this approach is feasible (at least in a couple of cases) and can lead to nontrivial mathematical results. A preliminary version can be downloaded freely from http://www.ieat.ro:8080/IeAT/researchreports/essa08-istrate.doc/download
Read more[Published only as an abstract on the conference website. Full-length paper to follow] We show that Lindenmayer systems can be learned in polynomial time from membership and equivalence queries (that is queries are syntax trees of the corresponding grammar). The result is directly motivated by (and can be applied to) the problem of learning the symbolic representations associated to dynamical systems induced by unimodal (and several classes of multimodal)
Read morehttp://www.mathunion.org/fileadmin/IMU/Report/CitationStatistics.pdf
Read more