1941 search results - page 29 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
CCCG
2007
13 years 8 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
IWANN
2001
Springer
13 years 12 months ago
2001
Springer
This paper proposes the general paradigm to build Q'tron neural networks (NNs) for visual cryptography. Given a visual encryption scheme, usually described using an access st...