Sciweavers

1983 search results - page 160 / 397
» Competitive graph searches
Sort
View
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
14 years 1 months ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj
GBRPR
2009
Springer
14 years 20 days ago
From Random to Hierarchical Data through an Irregular Pyramidal Structure
This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time...
Rimon Elias, Mohab Al Ashraf, Omar Aly
SBP
2011
Springer
13 years 3 months ago
Ranking Information in Networks
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
Tina Eliassi-Rad, Keith Henderson
SEMWEB
2009
Springer
14 years 2 months ago
Dynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes
RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently ...
Giovambattista Ianni, Thomas Krennwallner, Alessan...
ROBOCUP
2007
Springer
134views Robotics» more  ROBOCUP 2007»
14 years 2 months ago
A Scalable Hybrid Multi-robot SLAM Method for Highly Detailed Maps
Abstract. Recent successful SLAM methods employ hybrid map representations combining the strengths of topological maps and occupancy grids. Such representations often facilitate mu...
Max Pfingsthorn, Bayu Slamet, Arnoud Visser