Sciweavers

151 search results - page 18 / 31
» Minimizing Movement in Mobile Facility Location Problems
Sort
View
CEC
2010
IEEE
14 years 7 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...
INFOCOM
2009
IEEE
15 years 4 months ago
Double Mobility: Coverage of the Sea Surface with Mobile Sensor Networks
Abstract—We are interested in the sensor networks for scientific applications to cover and measure statistics on the sea surface. Due to flows and waves, the sensor nodes may g...
Ji Luo, Dan Wang, Qian Zhang
WALCOM
2007
IEEE
151views Algorithms» more  WALCOM 2007»
14 years 10 months ago
Base Station Placement Problem on the Boundary of a Convex Region
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. ...
87
Voted
TON
2012
12 years 12 months ago
Taming the Mobile Data Deluge With Drop Zones
—Human communication has changed by the advent of smartphones. Using commonplace mobile device features they started uploading large amounts of content that increases. This incre...
Ionut Trestian, Supranamaya Ranjan, Aleksandar Kuz...
SPAA
2005
ACM
15 years 3 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski