Sciweavers

21 search results - page 4 / 5
» Non-approximability Results for Scheduling Problems with Min...
Sort
View
ICPPW
2009
IEEE
13 years 3 months ago
Improvement of Messages Delivery Time on Vehicular Delay-Tolerant Networks
Vehicular Delay-Tolerant Networks (VDTNs) are an application of the Delay-Tolerant Network (DTN) concept, where the movement of vehicles and their message relaying service is used ...
Vasco Nuno da Gama de Jesus Soares, Joel Jos&eacut...
BROADNETS
2006
IEEE
13 years 11 months ago
Distributed Job Scheduling based on Multiple Constraints Anycast Routing
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...
OTM
2005
Springer
13 years 10 months ago
QoS-Aware Composition of Web Services: An Evaluation of Selection Algorithms
A composition arranges available services resulting in a defined flow of executions. Before the composition is carried out, a discovery service identifies candidate services. Th...
Michael C. Jaeger, Gero Mühl, Sebastian Golze
DAGSTUHL
2004
13 years 6 months ago
Simplicity Considered Fundamental to Design for Predictability
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
Wolfgang A. Halang
TIT
1998
112views more  TIT 1998»
13 years 5 months ago
Application of Network Calculus to Guaranteed Service Networks
—We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of resu...
Jean-Yves Le Boudec