Sciweavers

1986 search results - page 171 / 398
» constraints 2006
Sort
View
IJMC
2006
84views more  IJMC 2006»
13 years 8 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
IJSN
2006
124views more  IJSN 2006»
13 years 8 months ago
Wireless networking security: open issues in trust, management, interoperation and measurement
: The pervasive availability and wide usage of wireless networks with different kinds of topologies, techniques and protocol suites have brought with them a need to improve securit...
Joseph B. Evans, Weichao Wang, Benjamin J. Ewy
IJWMC
2006
84views more  IJWMC 2006»
13 years 8 months ago
Resilient and energy efficient tracking in sensor networks
: We present a new distributed mechanism for tracking moving objects with a network of sensors. To track such objects efficiently and accurately, we need techniques that allow the ...
Maria Halkidi, Dimitris Papadopoulos, Vana Kaloger...
IOR
2006
93views more  IOR 2006»
13 years 8 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini
IOR
2006
173views more  IOR 2006»
13 years 8 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau