The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
For the rendering of vector and tensor fields, several texturebased volumetric rendering methods were presented in recent years. While they have indisputable merits, the classica...
Ovidio Mallo, Ronald Peikert, Christian Sigg, Fili...