Sciweavers

186 search results - page 6 / 38
» Choreographies: using Constraints to Satisfy Service Request...
Sort
View
IOR
2006
173views more  IOR 2006»
14 years 10 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
CVIU
2006
168views more  CVIU 2006»
14 years 10 months ago
Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements
In many multi-camera vision systems the effect of camera locations on the task-specific quality of service is ignored. Researchers in Computational Geometry have proposed elegant ...
Ugur Murat Erdem, Stan Sclaroff
IRI
2008
IEEE
15 years 4 months ago
Modeling and synthesis of service composition using tree automata
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
Ken Q. Pu, Ying Zhu
WECWIS
2009
IEEE
162views ECommerce» more  WECWIS 2009»
15 years 4 months ago
QoS-Driven Web Service Composition Using Learning-Based Depth First Search
—The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic feature...
Wonhong Nam, Hyunyoung Kil, Jungjae Lee
ECOWS
2006
Springer
15 years 1 months ago
Maintaining Consistency between Loosely Coupled Services in the Presence of Timing Constraints and Validation Errors
Loose coupling is often cited as a defining characteristic of service-oriented architectures. Interactions between services take place via messages in an asynchronous environment ...
Carlos Molina-Jiménez, Santosh K. Shrivasta...