Sciweavers

1927 search results - page 140 / 386
» UMDAs for dynamic optimization problems
Sort
View
92
Voted
WADS
2007
Springer
89views Algorithms» more  WADS 2007»
15 years 7 months ago
Dynamic TCP Acknowledgment with Sliding Window
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 ...
Hisashi Koga
108
Voted
ISCC
2000
IEEE
104views Communications» more  ISCC 2000»
15 years 5 months ago
Dynamic Routing and Wavelength Assignment Using First Policy Iteration
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...
Esa Hyytiä, Jorma T. Virtamo
116
Voted
JACM
2007
132views more  JACM 2007»
15 years 22 days ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
109
Voted
AR
2010
133views more  AR 2010»
14 years 11 months ago
Coordinated Control of Space Robot Teams for the On-Orbit Construction of Large Flexible Space Structures
Teams of autonomous space robots are needed for future space missions such as the construction of large solar power stations and large space telescopes in earth orbit. This work fo...
Peggy Boning, Steven Dubowsky
214
Voted
INFOCOM
2011
IEEE
14 years 4 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...