Sciweavers

342 search results - page 23 / 69
» Constrained Integer Partitions
Sort
View
CCCG
2010
13 years 10 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
ARSCOM
2008
192views more  ARSCOM 2008»
13 years 8 months ago
Bounds on the metric and partition dimensions of a graph
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
Glenn G. Chappell, John G. Gimbel, Chris Hartman
LCN
2008
IEEE
14 years 2 months ago
Delay constrained placement of mobile data collectors in underwater acoustic sensor networks
—We propose a scheme for routing and placement of mobile data collectors in Underwater Acoustic Sensor Networks (UASNs). The proposed scheme maximizes the lifetime of the network...
Waleed Alsalih, Hossam S. Hassanein, Selim G. Akl
AINA
2010
IEEE
14 years 1 months ago
Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
Khaled Almiani, Anastasios Viglas, Lavy Libman
CAS
2008
68views more  CAS 2008»
13 years 8 months ago
Very Strongly Constrained Problems: an Ant Colony Optimization Approach
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
Vittorio Maniezzo, Matteo Roffilli