Sciweavers

1232 search results - page 100 / 247
» Digraphs: theory, algorithms and applications
Sort
View
MOBIHOC
2008
ACM
14 years 9 months ago
A game approach for multi-channel allocation in multi-hop wireless networks
Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-ho...
Lin Gao, Xinbing Wang
GRAPHICSINTERFACE
2001
13 years 10 months ago
Novel Solver for Dynamic Surfaces
Physics-based modeling integrates dynamics and geometry. The standard methods to solve the Lagrangian equations use a direct approach in the spatial domain. Though extremely power...
Sumantro Ray, Hong Qin
NETWORK
2010
122views more  NETWORK 2010»
13 years 4 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
ATAL
2011
Springer
12 years 9 months ago
Maximum causal entropy correlated equilibria for Markov games
Motivated by a machine learning perspective—that gametheoretic equilibria constraints should serve as guidelines for predicting agents’ strategies, we introduce maximum causal...
Brian D. Ziebart, J. Andrew Bagnell, Anind K. Dey
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 1 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu