Sciweavers

8109 search results - page 1501 / 1622
» A Model of Component-Based Programming
Sort
View
PE
2002
Springer
109views Optimization» more  PE 2002»
15 years 3 months ago
Load-dependent service queues with application to congestion control in broadband networks
: We analyze D/G/1 and M/G/1 queues where the service time for an arrival depends on the amount of work in the system upon arrival. The models are motivated by the bit dropping met...
Kin K. Leung
TPDS
1998
98views more  TPDS 1998»
15 years 2 months ago
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
Yeh-Ching Chung, Ching-Hsien Hsu, Sheng-Wen Bai
TC
2002
15 years 2 months ago
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
We present novel grid coverage strategies for effective surveillance and target location in distributed sensor networks. We represent the sensor field as a grid (two or three-dimen...
Krishnendu Chakrabarty, S. Sitharama Iyengar, Hair...
VLDB
2002
ACM
156views Database» more  VLDB 2002»
15 years 2 months ago
A Logical Framework for Scheduling Workflows under Resource Allocation Constraints
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
Pinar Senkul, Michael Kifer, Ismail Hakki Toroslu
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 2 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
« Prev « First page 1501 / 1622 Last » Next »