Sciweavers

1402 search results - page 33 / 281
» Sparse-Memory Graph Search
Sort
View
RECOMB
2004
Springer
15 years 10 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
ITS
2004
Springer
153views Multimedia» more  ITS 2004»
15 years 3 months ago
Modeling Students' Reasoning About Qualitative Physics: Heuristics for Abductive Proof Search
Abstract. We describe a theorem prover that is used in the Why2Atlas tutoring system for the purposes of evaluating the correctness of a student’s essay and for guiding feedback ...
Maxim Makatchev, Pamela W. Jordan, Kurt VanLehn
GLOBECOM
2006
IEEE
15 years 3 months ago
On the Search of Internet AS-level Topology Invariants
— There has been a significant amount of work analyzing the Internet AS (Autonomous System)-level topology which gives rise to a number of topology models. Although each of thes...
Lung-de Shyu, Seng-Yong Lau, Polly Huang
IANDC
2008
85views more  IANDC 2008»
14 years 9 months ago
Monotony properties of connected visible graph searching
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to
Pierre Fraigniaud, Nicolas Nisse
IFIP12
2009
14 years 7 months ago
Revealing Paths of Relevant Information in Web Graphs
In this paper we propose a web search methodology based on the Ant Colony Optimization (ACO) algorithm, which aims to enhance the amount of the relevant information in respect to a...
Georgios Kouzas, Vassilis Kolias, Ioannis Anagnost...