Sciweavers

3604 search results - page 29 / 721
» All Common Subsequences
Sort
View
ICSOC
2005
Springer
14 years 2 months ago
Speaking a Common Language: A Conceptual Model for Describing Service-Oriented Systems
The diffusion of service-oriented computing is today heavily influencing many software development and research activities. Despite this, service-oriented computing is a relative...
Massimiliano Colombo, Elisabetta Di Nitto, Massimi...
WDAG
1990
Springer
72views Algorithms» more  WDAG 1990»
14 years 15 days ago
Common Knowledge and Consistent Simultaneous Coordination
Traditional problems in distributed systems include the Reliable Broadcast, Distributed Consensus, and Distributed Firing Squad problems. These problems require coordination only ...
Gil Neiger, Mark R. Tuttle
WSC
1997
13 years 9 months ago
How Common Random Numbers Affect Multinomial Selection
We consider the effect of common random numbers (CRNs) among simulated systems in two different multinomial selection procedures; the classical procedure BEM (Bechhofer, Elmaghr...
John O. Miller, Kenneth W. Bauer Jr.
AICOM
2006
124views more  AICOM 2006»
13 years 8 months ago
A Compact Representation for Least Common Subsumers in the description logic ALE
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
DISOPT
2008
89views more  DISOPT 2008»
13 years 8 months ago
Group sequencing around a common due date
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...