10493 search results - page 365 / 2099 » Dynamic Word Problems |
182
Voted
ICCTA
2007
IEEE
16 years 28 days ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
187
click to vote
MATES
2007
Springer
16 years 25 days ago
2007
Springer
In real-life multi-agent planning problems, long-term plans will often be invalidated by changes in the environment during or after the planning process. When this happens, short-t...
162
click to vote
WADS
2007
Springer
16 years 24 days ago
2007
Springer
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
190
click to vote
ISCC
2000
IEEE
15 years 11 months ago
2000
IEEE
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
164
click to vote
DAWAK
1999
Springer
15 years 11 months ago
1999
Springer
A data warehouse DW can be seen as a set of materialized views de ned over remote base relations. When a query is posed, it is evaluated locally, using the materialized views, wi...