Sciweavers

11371 search results - page 295 / 2275
» The network inhibition problem
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
AMC
2005
127views more  AMC 2005»
15 years 6 months ago
The identification of nondominated and efficient paths on a network
In this paper, we present an application of 0-1 linear programming problem in the indentification of the nondominated paths on a network. To find efficient paths, an adaptationof t...
Gholam Reza Jahanshahloo, F. Hosseinzadeh Lotfi, N...
JDA
2007
98views more  JDA 2007»
15 years 6 months ago
Admission control with advance reservations in simple networks
In the admission control problem we are given a network and a set of connection requests, each of which is associated with a path, a time interval, a bandwidth requirement, and a ...
Dror Rawitz
204
Voted
ANCS
2005
ACM
16 years 10 days ago
Resource mapping and scheduling for heterogeneous network processor systems
Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first pro...
Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinh...
WAOA
2004
Springer
91views Algorithms» more  WAOA 2004»
16 years 3 days ago
Pricing Network Edges to Cross a River
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
Alexander Grigoriev, Stan P. M. van Hoesel, Anton ...