Sciweavers

1484 search results - page 110 / 297
» Ants meeting algorithms
Sort
View
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
15 years 2 months ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe
ICDM
2007
IEEE
162views Data Mining» more  ICDM 2007»
15 years 1 months ago
Exploiting Network Structure for Active Inference in Collective Classification
Active inference seeks to maximize classification performance while minimizing the amount of data that must be labeled ex ante. This task is particularly relevant in the context o...
Matthew J. Rattigan, Marc Maier, David Jensen, Bin...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 1 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
ICPR
2008
IEEE
15 years 4 months ago
A study of on-line handwritten chemical expressions recognition
In this paper, we study the major modules of on-line handwritten chemical expressions recognition. We propose a novel two-level algorithm to recognize expressions. In the first le...
Jufeng Yang, Guangshun Shi, Kai Wang, Qian Geng, Q...
ISPAN
2005
IEEE
15 years 3 months ago
Increasing Sensor Network Lifetime by Identifying and Leveraging Nodes with Excess Energy In Heterogeneous Networks
We propose and evaluate wireless sensor routing algorithms designed to extend the lifetime of a heterogeneous wireless sensor network. The network is heterogeneous in the sensorsâ...
Keith Hellman, Michael Colagrosso