Cerca risorse accademiche

Formal languages and automata theory (FL&AT) are central subjects in the CS curricula which are usually diffcult both to teach and to learn. This situation has motivated the development of a number of computer simulators...

It is a well established fact, that - in the case of classical random graphs like (variants of) Gn,p or random regular graphs - spectral methods yield efficient algorithms for clustering (e. g. colouring or bisection) pr...

Historically Functional Programming FP for short has been associated with a small scope of applications mainly academic The computer science community did not pay enough attention to its potential perhaps due t...

Approximation algorithms for a class of planar graph problems, including planar independent set, planar vertex cover and planar dominating set, were intensively studied. The current upper bound on the running time of the...

El diseño de sistemas informáticos para sitios de negocios electrónicos puede realizarse con configuraciones variadas de recursos de hardware, software y comunicaciones. Fundamentalmente debe considerar los requerimie...

Materie / parole chiave: Computer science; Mathematics; Set theory; Problems, exercises, etc; Algorithms; Logic, Symbolic and mathematical; Problems and exercises; Electronic books

We compute the influence of a vertex on the connectivity structure of a directed network by using Shapley value theory. In general, the computation of such ratings is highly inefficient. We show how the computation can b...