Sciweavers

8496 search results - page 75 / 1700
» Problem Solving and Complex Systems
Sort
View
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
13 years 11 months ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
ATAL
2006
Springer
13 years 11 months ago
Forming efficient agent groups for completing complex tasks
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
Efrat Manisterski, Esther David, Sarit Kraus, Nich...
ICC
2007
IEEE
119views Communications» more  ICC 2007»
14 years 2 months ago
A Convex Quadratic SDMA Grouping Algorithm Based on Spatial Correlation
Abstract— Space Division Multiple Access (SDMA) is a promising solution to improve the spectral efficiency of future mobile radio systems. However, finding the group of MSs tha...
Tarcisio F. Maciel, Anja Klein
PPSN
2004
Springer
14 years 1 months ago
Evaluation of Adaptive Nature Inspired Task Allocation Against Alternate Decentralised Multiagent Strategies
Adaptive multiagent algorithms based upon the behaviour of social insects are powerful decentralised systems capable of solving complex problems. The intelligence of such a system ...
Richard Price, Peter Tiño