Sciweavers

1662 search results - page 16 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
AAAI
2007
13 years 9 months ago
Acquiring Visibly Intelligent Behavior with Example-Guided Neuroevolution
Much of artificial intelligence research is focused on devising optimal solutions for challenging and well-defined but highly constrained problems. However, as we begin creating...
Bobby D. Bryant, Risto Miikkulainen
WG
2010
Springer
13 years 5 months ago
Parameterized Complexity of the Arc-Preserving Subsequence Problem
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
Dániel Marx, Ildikó Schlotter
FAABS
2000
Springer
13 years 11 months ago
Design and Mathematical Analysis of Agent-Based Systems
Abstract. Agent-based systems that are composed of simple locally interacting agents but which demonstrate complex group behavior o er several advantages over traditional multi-age...
Kristina Lerman
ATAL
2003
Springer
13 years 11 months ago
Analyzing the efficiency of strategies for MAS-based sensor interpretation and diagnosis
One of the factors holding back the application of multiagent, distributed approaches to large-scale sensor interpretation and diagnosis problems is the lack of good techniques fo...
Norman Carver, Ruj Akavipat
JOT
2007
113views more  JOT 2007»
13 years 7 months ago
Pattern-Oriented Design for Multi-Agent System: A Conceptual Model
Design patterns represent solutions to specific problem of developing one application that have evolved over time. They leverage the reuse level to the design phase by providing a...
Radziah Mohamad, Safaai Deris, Hany H. Ammar