Sciweavers

1578 search results - page 102 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 3 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
TOG
2008
122views more  TOG 2008»
13 years 8 months ago
Musculotendon simulation for hand animation
We describe an automatic technique for generating the motion of tendons and muscles under the skin of a traditionally animated character. This is achieved by integrating the tradi...
Shinjiro Sueda, Andrew Kaufman, Dinesh K. Pai
TPDS
2002
155views more  TPDS 2002»
13 years 8 months ago
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
Jie Wu
INFOCOM
2007
IEEE
14 years 3 months ago
Routing and Channel Allocation in Rural Wireless Mesh Networks
— IEEE 802.11 Wi-Fi equipment based wireless mesh networks have recently been proposed as an inexpensive approach to connect far-flung rural areas. Such networks are built using...
Partha Dutta, Sharad Jaiswal, Rajeev Rastogi
VTC
2006
IEEE
115views Communications» more  VTC 2006»
14 years 2 months ago
Suboptimal Maximum Likelihood Detection Using Gradient-based Algorithm for MIMO Channels
Abstract— This paper proposes a suboptimal maximum likelihood detection (MLD) algorithm for multiple-input multipleoutput (MIMO) communications. The proposed algorithm regards tr...
Thet Htun Khine, Kazuhiko Fukawa, Hiroshi Suzuki