Sciweavers

2517 search results - page 409 / 504
» Specifying Weak Sets
Sort
View
SIGMETRICS
2002
ACM
103views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Network tomography on general topologies
In this paper we consider the problem of inferring link-level loss rates from end-to-end multicast measurements taken from a collection of trees. We give conditions under which lo...
Tian Bu, Nick G. Duffield, Francesco Lo Presti, Do...
TOCL
2002
110views more  TOCL 2002»
15 years 6 months ago
Abstract computability and algebraic specification
Computability and Algebraic Specification J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER McMaster University Abstract computable functions are defined by abstract finit...
J. V. Tucker, Jeffery I. Zucker
VLDB
2002
ACM
156views Database» more  VLDB 2002»
15 years 6 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
ENTCS
2007
190views more  ENTCS 2007»
15 years 6 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
NETWORKS
2007
15 years 6 months ago
Survivable IP network design with OSPF routing
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
Luciana S. Buriol, Mauricio G. C. Resende, Mikkel ...