Sciweavers

1047 search results - page 208 / 210
» Learning the required number of agents for complex tasks
Sort
View
ICPP
2000
IEEE
14 years 1 days ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
HPDC
1999
IEEE
13 years 12 months ago
Remote Application Scheduling on Metacomputing Systems
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
Heath A. James, Kenneth A. Hawick
ESEC
1999
Springer
13 years 12 months ago
Synergy between Component-Based and Generative Approaches
Building software systems out of pre-fabricated components is a very attractive vision. Distributed Component Platforms (DCP) and their visual development environments bring this v...
Stan Jarzabek, Peter Knauber
ICFP
2010
ACM
13 years 8 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
CCE
2008
13 years 7 months ago
Dynamic scheduling of multiproduct pipelines with multiple delivery due dates
Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Mo...
Diego C. Cafaro, Jaime Cerdá