Sciweavers

3757 search results - page 566 / 752
» The overlap number of a graph
Sort
View
PAM
2005
Springer
15 years 12 months ago
Revisiting Internet AS-Level Topology Discovery
Abstract. The development of veracious models of the Internet topology has received a lot of attention in the last few years. Many proposed models are based on topologies derived f...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, G...
WG
2005
Springer
15 years 12 months ago
Approximation Algorithms for the Weighted Independent Set Problem
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
Akihisa Kako, Takao Ono, Tomio Hirata, Magnú...
DMSN
2004
ACM
15 years 12 months ago
Optimization of in-network data reduction
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Joseph M. Hellerstein, Wei Wang
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
15 years 12 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
APN
2004
Springer
15 years 12 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo