Sciweavers

355 search results - page 6 / 71
» A general, fully distributed multi-agent planning algorithm
Sort
View
AIPS
2006
15 years 1 months ago
Scalable Planning for Distributed Stream Processing Systems
Recently the problem of automatic composition of workflows has been receiving increasing interest. Initial investigation has shown that designing a practical and scalable composit...
Anton Riabov, Zhen Liu
ICDCS
2006
IEEE
15 years 5 months ago
Distributed Computing for Efficient Hyperspectral Imaging Using Fully Heterogeneous Networks of Workstations
Hyperspectral imaging is a new technique which has become increasingly important in many remote sensing applications, including automatic target recognition for military and defen...
Antonio Plaza, Javier Plaza, David Valencia
SAC
2004
ACM
15 years 5 months ago
A robust deception-free coalition formation model
We study two properties of coalition formation algorithms, very important for their application in real-life scenarios: robustness and tolerance to some agent misbehaviors. The st...
María-Victoria Belmonte, Ricardo Conejo, Jo...
SIGSOFT
2008
ACM
16 years 10 days ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
62
Voted
ICRA
2006
IEEE
77views Robotics» more  ICRA 2006»
15 years 5 months ago
Scalable Shape Sculpting via Hole Motion: Motion Planning in Lattice-constrained Modular Robots
— We describe a novel shape formation algorithm for ensembles of 2-dimensional lattice-arrayed modular robots, based on the manipulation of regularly shaped voids within the latt...
Michael DeRosa, Seth Copen Goldstein, Peter Lee, J...