Sciweavers

414 search results - page 73 / 83
» A parallel extended GCD algorithm
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Robust and efficient plan recognition for dynamic multi-agent teams
This paper addresses the problem of plan recognition for multiagent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. T...
Gita Sukthankar, Katia P. Sycara
DAGSTUHL
2006
13 years 9 months ago
Decentralization and Mechanism Design for Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
ISCAPDCS
2003
13 years 9 months ago
Optimal Graph Transformation Assuming Alternate Scheduling Models
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graph...
Timothy W. O'Neil
AROBOTS
2004
119views more  AROBOTS 2004»
13 years 7 months ago
Swarm-Bot: A New Distributed Robotic Concept
The swarm intelligence paradigm has proven to have very interesting properties such as robustness, flexibility and ability to solve complex problems exploiting parallelism and self...
Francesco Mondada, Giovanni C. Pettinaro, Andr&eac...
EMNLP
2009
13 years 5 months ago
The infinite HMM for unsupervised PoS tagging
We extend previous work on fully unsupervised part-of-speech tagging. Using a non-parametric version of the HMM, called the infinite HMM (iHMM), we address the problem of choosing...
Jurgen Van Gael, Andreas Vlachos, Zoubin Ghahraman...