1402 search results - page 127 / 281 » Searching Cycle-Disjoint Graphs |
100
click to vote
SIGMOD
2010
ACM
14 years 10 months ago
2010
ACM
Automated extraction of structured data from Web sources often leads to large heterogeneous knowledge bases (KB), with data and schema items numbering in the hundreds of thousands...
AI
2008
Springer
14 years 10 months ago
2008
Springer
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
IROS
2006
IEEE
15 years 4 months ago
2006
IEEE
— This paper describes the use of natural language route descriptions in the mobile robot navigation domain. Guided by corpus analysis and earlier work on coarse qualitative rout...
120
click to vote
ANTSW
2004
Springer
15 years 1 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...