625 search results - page 60 / 125 » Approximating Travel Times Using Opportunistic Networking |
125
Voted
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract Minimizing the energy consumption of target tracking using a mobile sensor network is proved to be NPcomplete. Based on proximity graph, an approximately optimal solution ...
117
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
151
Voted
TMC
2011
14 years 10 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
182
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
151
Voted
CIRA
2007
IEEE
15 years 9 months ago
2007
IEEE
— This research identifies a strategy called compliant formation control, which may be used to coordinate the navigational structure of a team of autonomous vehicles. This techni...