Sciweavers

4131 search results - page 118 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
ICMAS
2000
15 years 4 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
NETWORKS
2006
15 years 3 months ago
The multiroute maximum flow problem revisited
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
Donglei Du, R. Chandrasekaran
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 7 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
15 years 8 months ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen
IJCAI
2003
15 years 4 months ago
Definition and Complexity of Some Basic Metareasoning Problems
In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to t...
Vincent Conitzer, Tuomas Sandholm