Sciweavers

17185 search results - page 3299 / 3437
» Computational and Quantitative Studies
Sort
View
SIGMETRICS
2004
ACM
15 years 3 months ago
A mean-field analysis of short lived interacting TCP flows
In this paper, we consider a set of HTTP flows using TCP over a common drop-tail link to download files. After each download, a flow waits for a random think time before reques...
François Baccelli, Augustin Chaintreau, Dan...
ADHOCNOW
2004
Springer
15 years 3 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
ASWSD
2004
Springer
15 years 3 months ago
Simulink Integration of Giotto/TDL
The paper first presents the integration options of what we call the Timing Description Language (TDL) with MathWorks' Simulink tools. Based on the paradigm of logical executi...
Wolfgang Pree, Gerald Stieglbauer, Josef Templ
CP
2004
Springer
15 years 3 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 3 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
« Prev « First page 3299 / 3437 Last » Next »