1628 search results - page 305 / 326 » Partitioning Sets with Genetic Algorithms |
131
click to vote
DMSN
2007
ACM
15 years 7 months ago
2007
ACM
This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm1 . Our objectives are to explore a given geographic region by detecting and aggregating sp...
145
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
118
Voted
ORL
1998
15 years 3 months ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
130
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
140
click to vote
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
Agents collaborating on a set of tasks subject to temporal constraints must coordinate their activities to ensure that all of the temporal constraints are ultimately satisfied. S...