Sciweavers

2109 search results - page 247 / 422
» Solving Necklace Constraint Problems
Sort
View
NETWORKING
2007
15 years 7 months ago
Optimal Rate Allocation in Overlay Content Distribution
This paper addresses the optimal rate allocation problem in overlay content distribution for efficient utilization of limited bandwidths. We systematically present a series of opti...
Chuan Wu, Baochun Li
RC
2002
96views more  RC 2002»
15 years 5 months ago
Verification of Invertibility of Complicated Functions over Large Domains
A new method to decide the invertibility of a given high-dimensional function over a domain is presented. The problem arises in the field of verified solution of differential algeb...
Jens Hoefkens, Martin Berz
CORR
2008
Springer
127views Education» more  CORR 2008»
15 years 5 months ago
Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks
The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes f...
Adnan Vora, Mikhail Nesterenko, Sébastien T...
COR
2007
134views more  COR 2007»
15 years 6 months ago
Portfolio selection using neural networks
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
Alberto Fernández, Sergio Gómez
GLOBECOM
2010
IEEE
15 years 4 months ago
Sliding Mode Based Joint Congestion Control and Scheduling in Multi-Hop Ad Hoc Networks with Multi-Class Services
In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated...
Zongrui Ding, Dapeng Wu