Sciweavers

ATAL
2010
Springer
13 years 5 months ago
Assignment problem in requirements driven agent collaboration and its implementation
Requirements Driven Agent Collaboration (RDAC) is a mechanism where the self-interested service agents actively and autonomously search for the required services submitted by the ...
Jian Tang, Zhi Jin
IPCO
1990
76views Optimization» more  IPCO 1990»
13 years 5 months ago
Probabilistic Analysis of the Generalised Assignment Problem
We analyse the generalised assignment problem under the assumption that all coefficients are drawn uniformly and independently from [0,1]. We show that such problems can be solved...
Martin E. Dyer, Alan M. Frieze
ICWN
2003
13 years 5 months ago
Comparison of Heuristic and Optimal Subcarrier Assignment Algorithms
Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals, each one getting only some of the available subcarriers. Judiciously ass...
James Gross, Holger Karl, Frank H. P. Fitzek, Adam...
EUC
2008
Springer
13 years 6 months ago
Dynamic and Leakage Power Minimization with Loop Voltage Scheduling and Assignment
This paper studies the scheduling and assignment problem that minimizes the total energy including both dynamic and leakage energy for applications with loops on multi-voltage, mul...
Meikang Qiu, Jiande Wu, Jingtong Hu, Yi He, Edwin ...
ATAL
2006
Springer
13 years 8 months ago
Distributed Lagrangean relaxation protocol for the generalized mutual assignment problem
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
Katsutoshi Hirayama
SLS
2009
Springer
274views Algorithms» more  SLS 2009»
13 years 9 months ago
A Memetic Algorithm for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
Gregory Gutin, Daniel Karapetyan
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
13 years 9 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
VLDB
2005
ACM
116views Database» more  VLDB 2005»
13 years 10 months ago
Client Assignment in Content Dissemination Networks for Dynamic Data
Consider a content distribution network consisting of a set of sources, repositories and clients where the sources and the repositories cooperate with each other for efficient di...
Shetal Shah, Krithi Ramamritham, Chinya V. Ravisha...
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
13 years 10 months ago
Genetic algorithms for the sailor assignment problem
This paper examines a real-world application of genetic algorithms – solving the United States Navy’s Sailor Assignment Problem (SAP). The SAP is a complex assignment problem ...
Deon Garrett, Joseph Vannucci, Rodrigo Silva, Dipa...
IWCMC
2006
ACM
13 years 10 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan