Sciweavers

7565 search results - page 80 / 1513
» Pricing Network Services
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 1 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
MIDDLEWARE
2004
Springer
14 years 2 months ago
Interoperability Among Independently Evolving Web Services
The increasing popularity of XML Web services motivates us to examine if it is feasible to substitute one vendor service for another when using a Web-based application, assuming th...
Shankar Ponnekanti, Armando Fox
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 10 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
IEEEAMS
2003
IEEE
14 years 2 months ago
A Programmable Routing Framework for Autonomic Sensor Networks
This paper proposes a programmable routing framework that promotes the adaptivity in routing services for sensor networks. This framework includes a universal routing service and ...
JSS
2008
93views more  JSS 2008»
13 years 9 months ago
A framework for QoS-aware binding and re-binding of composite web services
QoS-aware dynamic binding of composite services provides the capability of binding each service invocation in a composition to a service chosen among a set of functionally equival...
Gerardo Canfora, Massimiliano Di Penta, Raffaele E...