Sciweavers

1929 search results - page 149 / 386
» An Approach to Limit the Wynot Problem
Sort
View
IPPS
1998
IEEE
15 years 10 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot
ICNP
1997
IEEE
15 years 10 months ago
TCP behavior with many flows
TCP's ability to share a bottleneck fairly and efficiently decreases as the number of competing flows increases. This effect starts to appear when there are more flows than p...
Robert Morris
CIDM
2009
IEEE
15 years 10 months ago
Handling continuous attributes in Ant Colony Classification algorithms
Most real-world classification problems involve continuous (real-valued) attributes, as well as, nominal (discrete) attributes. The majority of Ant Colony Optimisation (ACO) classi...
Fernando E. B. Otero, Alex Alves Freitas, Colin G....
ESCIENCE
2006
IEEE
15 years 10 months ago
Designing Workflow Components for e-Science
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
Frank Terpstra, Pieter W. Adriaans
DL
1995
Springer
143views Digital Library» more  DL 1995»
15 years 10 months ago
Digital Libraries: Issues and Architectures
The research field of digital libraries must be viewed as a union of subfields from a variety of domains combined with new research issues in order to realize its full potential....
Peter J. Nürnberg, Richard Furuta, John J. Le...