Sciweavers

98 search results - page 16 / 20
» Complexity of the traveling tournament problem
Sort
View
COSIT
2009
Springer
159views GIS» more  COSIT 2009»
14 years 2 months ago
Adaptable Path Planning in Regionalized Environments
Human path planning relies on several more aspects than only geometric distance between two locations. These additional aspects mostly relate to the complexity of the traveled path...
Kai-Florian Richter
IAT
2006
IEEE
14 years 1 months ago
A Component-Based Architecture for Multi-Agent Systems
A Multi-agent system (MAS) is an open distributed system of agents. The agents in a MAS may form certain specific groups, where agents in each group jointly engage in solving a s...
Kaiyu Wan, Vasu S. Alagar
ATAL
2010
Springer
13 years 8 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
CEC
2008
IEEE
14 years 2 months ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
IRI
2007
IEEE
14 years 1 months ago
MAGIC: A Multi-Activity Graph Index for Activity Detection
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
Massimiliano Albanese, Andrea Pugliese, V. S. Subr...