Sciweavers

1402 search results - page 156 / 281
» Sparse-Memory Graph Search
Sort
View
WEBI
2010
Springer
15 years 2 months ago
Lightweight Clustering Methods for Webspam Demotion
Abstract--To make sure they can quickly respond to a specific query, the main search engines have several mechanisms. One of them consists in ranking web pages according to their i...
Thomas Largillier, Sylvain Peyronnet
CGF
2011
14 years 8 months ago
Global Structure Optimization of Quadrilateral Meshes
We introduce a fully automatic algorithm which optimizes the high-level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological ...
David Bommes, Timm Lempfer, Leif Kobbelt
130
Voted
HEURISTICS
2008
124views more  HEURISTICS 2008»
15 years 4 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
SIGIR
2010
ACM
15 years 8 months ago
Query similarity by projecting the query-flow graph
Defining a measure of similarity between queries is an interesting and difficult problem. A reliable query-similarity measure can be used in a variety of applications such as que...
Ilaria Bordino, Carlos Castillo, Debora Donato, Ar...
154
Voted
AIPS
2000
15 years 5 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
Amnon Lotem, Dana S. Nau