Sciweavers

1760 search results - page 307 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
RTCSA
2005
IEEE
14 years 1 months ago
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
Jian-Jia Chen, Jun Wu, Chi-Sheng Shih, Tei-Wei Kuo
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
14 years 1 months ago
An approach for QoS-aware service composition based on genetic algorithms
Web services are rapidly changing the landscape of software engineering. One of the most interesting challenges introduced by web services is represented by Quality Of Service (Qo...
Gerardo Canfora, Massimiliano Di Penta, Raffaele E...
SSD
2005
Springer
173views Database» more  SSD 2005»
14 years 1 months ago
On Discovering Moving Clusters in Spatio-temporal Data
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras
SC
2004
ACM
14 years 1 months ago
Optimal File-Bundle Caching Algorithms for Data-Grids
The file-bundle caching problem arises frequently in scientific applications where jobs process several files concurrently. Consider a host system in a data-grid that maintains...
Ekow J. Otoo, Doron Rotem, Alexandru Romosan
AOSE
2004
Springer
14 years 1 months ago
A Framework for Patterns in Gaia: A Case-Study with Organisations
Abstract. The agent-oriented approach has been successfully applied to the solution of complex problems in dynamic open environments. However, to extend its use to mainstream compu...
Jorge Gonzalez-Palacios, Michael Luck