218 search results - page 38 / 44 » Strong Bounds Consistencies and Their Application to Linear ... |
RTCSA
2000
IEEE
14 years 29 days ago
2000
IEEE
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...
COMPSAC
2004
IEEE
14 years 10 days ago
2004
IEEE
Web services (WS) received significant attention recently because services can be searched, bound, and executed at runtime over the Internet. This paper proposes a dynamic reconfi...
VLDB
2002
ACM
14 years 8 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
SIAMCO
2002
13 years 8 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
DNA
2006
Springer
14 years 8 days ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...