1101 search results - page 48 / 221 » heuristics 2007 |
CCCG
2001
13 years 9 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
IICAI
2003
13 years 9 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
AROBOTS
2004
13 years 7 months ago
2004
In this paper, we present discrete-time, nonspatial, macroscopic models able to capture the dynamics of collective aggregation experiments using groups of embodied agents endowed ...
DMIN
2007
13 years 9 months ago
2007
K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k ...
DGO
2004
13 years 9 months ago
2004
Question answering (QA) on table data is a challenging information retrieval task. This paper describes a QA system for tables created with both machine learning and heuristic tab...