Sciweavers

398 search results - page 10 / 80
» Ant Algorithm for the Graph Matching Problem
Sort
View
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 7 months ago
Problem Solving and Complex Systems
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
Frédéric Guinand, Yoann Pigné
IJRR
2008
92views more  IJRR 2008»
13 years 7 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Soft Region Correspondence Estimation for Graph-Theoretic Image Retrieval Using Quadratic Programming Approach
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
Chuech-Yu Li, Chiou-Ting Hsu
BIRD
2008
Springer
119views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...
Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayas...