Sciweavers

5465 search results - page 23 / 1093
» Assigning Types to Processes
Sort
View
TPDS
1998
118views more  TPDS 1998»
13 years 7 months ago
Optimizing Computing Costs Using Divisible Load Analysis
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...
Jeeho Sohn, Thomas G. Robertazzi, Serge Luryi
CIAC
2006
Springer
106views Algorithms» more  CIAC 2006»
13 years 11 months ago
On the Hardness of Range Assignment Problems
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Bernhard Fuchs
ATAL
2010
Springer
13 years 8 months ago
Role evolution in Open Multi-Agent Systems as an information source for trust
In Open Multi-Agent Systems (OMAS), deciding with whom to interact is a particularly difficult task for an agent, as repeated interactions with the same agents are scarce, and rep...
Ramón Hermoso, Holger Billhardt, Sascha Oss...
ICRA
2009
IEEE
122views Robotics» more  ICRA 2009»
14 years 2 months ago
Probabilistic search optimization and mission assignment for heterogeneous autonomous agents
— This paper presents an algorithmic framework for conducting search and identification missions using multiple heterogeneous agents. Dynamic objects of type “neutral” or ...
Timothy H. Chung, Moshe Kress, Johannes O. Royset
INLG
2010
Springer
13 years 5 months ago
JU_CSE_GREC10: Named Entity Generation at GREC 2010
This paper presents the experiments carried out at Jadavpur University as part of the participation in the GREC Named Entity Generation Challenge 2010. The Baseline system is base...
Amitava Das, Tanik Saikh, Tapabrata Mondal, Sivaji...