Sciweavers

1893 search results - page 131 / 379
» Computational composites
Sort
View
150
Voted
IEEESCC
2005
IEEE
15 years 10 months ago
Discovering Semantic Relations between Web Services Using Their Pre and Post-Conditions
Discovering and assembling individual Web services into more complex yet new and more useful Web processes has received significant attention from academia recently. In this thesi...
Lin Lin, Ismailcem Budak Arpinar
129
Voted
GI
2007
Springer
15 years 11 months ago
On Factoring Arbitrary Integers with Known Bits
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...
Mathias Herrmann, Alexander May
ICALP
2004
Springer
15 years 10 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
WSC
2008
15 years 7 months ago
A simulation framework for service-oriented computing systems
An SOA-compliant DEVS (SOAD) simulation framework is proposed for modeling service-oriented computing systems. A set of novel abstract component models that conform to the SOA pri...
Hessam S. Sarjoughian, Sungung Kim, Muthukumar Ram...
ICCS
2007
Springer
15 years 11 months ago
Composing Different Models of Computation in Kepler and Ptolemy II
A model of computation (MoC) is a formal abstraction of execution in a computer. There is a need for composing MoCs in e-science. Kepler, which is based on Ptolemy II, is a scienti...
Antoon Goderis, Christopher Brooks, Ilkay Altintas...