Sciweavers

178 search results - page 9 / 36
» Martin's maximum revisited
Sort
View
AI
2010
Springer
14 years 9 months ago
Soft arc consistency revisited
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...
CORR
2010
Springer
107views Education» more  CORR 2010»
14 years 8 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
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...
Martin Fink, Joachim Spoerhase
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Nash equilibria in graphical games on trees revisited
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...
INFOCOM
2005
IEEE
15 years 3 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— 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 ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
VISUALIZATION
2005
IEEE
15 years 3 months ago
Illuminated Lines Revisited
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...