6110 search results - page 280 / 1222 » Approximate Computing |
172
click to vote
ICTAI
2008
IEEE
16 years 1 months ago
2008
IEEE
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...
202
click to vote
ICSM
2007
IEEE
16 years 28 days ago
2007
IEEE
In this paper, we introduce Static Execute After (SEA) relationship among program components and present an efficient analysis algorithm. Our case studies show that SEA may appro...
183
click to vote
HYBRID
2007
Springer
16 years 24 days ago
2007
Springer
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discretetime, controlled stochastic hybrid systems. It i...
152
click to vote
AUSAI
1999
Springer
15 years 11 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
164
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...