Sciweavers

870 search results - page 12 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
CVPR
2003
IEEE
14 years 21 days ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
ECAI
2008
Springer
13 years 9 months ago
Theoretical Study of Ant-based Algorithms for Multi-Agent Patrolling
This paper addresses the multi-agent patrolling problem, which consists for a set of autonomous agents to visit all the places of an unknown environment as regularly as possible. T...
Arnaud Glad, Olivier Simonin, Olivier Buffet, Fran...
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 1 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
ENDM
2010
101views more  ENDM 2010»
13 years 7 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
ECIS
2003
13 years 8 months ago
The method evaluation model: a theoretical model for validating information systems design methods
Information Systems (IS) design research tends to emphasise the development of new methods (normative research), while addressing the evaluation of methods in only a limited fashi...
Daniel L. Moody