Sciweavers

106 search results - page 17 / 22
» An Approximate Algorithm for Resource Allocation Using Combi...
Sort
View
COMSWARE
2006
IEEE
14 years 1 months ago
Resource management in heterogenous wireless networks with overlapping coverage
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
Bin Bin Chen, Mun Choon Chan
IPPS
2009
IEEE
14 years 2 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
JAIR
2007
141views more  JAIR 2007»
13 years 7 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
ANTSW
2006
Springer
13 years 11 months ago
Kernelization as Heuristic Structure for the Vertex Cover Problem
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
Stephen Gilmour, Mark Dras
IPTPS
2003
Springer
14 years 20 days ago
Rationality and Self-Interest in Peer to Peer Networks
Much of the existing work in peer to peer networking assumes that users will follow prescribed protocols without deviation. This assumption ignores the user’s ability to modify ...
Jeffrey Shneidman, David C. Parkes