3192 search results - page 344 / 639 » The minimum latency problem |
162
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
134
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
149
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engag...
130
click to vote
IROS
2006
IEEE
15 years 10 months ago
2006
IEEE
– We consider a search for a target moving within a known indoor environment partitioned into interconnected regions of varying sizes. The knowledge of target location is describ...
133
click to vote
ACRI
2006
Springer
15 years 10 months ago
2006
Springer
The goal of our investigation is to find automatically the absolutely best rule for a moving creature in a cellular field. The task of the creature is to visit all empty cells wi...