Sciweavers

1388 search results - page 56 / 278
» Approximability of Robust Network Design
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
OA
1989
237views Algorithms» more  OA 1989»
13 years 11 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
CODES
2003
IEEE
14 years 28 days ago
Deriving process networks from weakly dynamic applications in system-level design
We present an approach to the automatic derivation of executable Process Network specifications from Weakly Dynamic Applications. We introduce the notions of Dynamic Single Assig...
Todor Stefanov, Ed F. Deprettere
WIOPT
2010
IEEE
13 years 6 months ago
On the optimal design of MAC protocols in multi-hop ad hoc networks
Abstract—In this paper, we present our results on the performance of MAC protocols in multi-hop wireless ad hoc networks in terms of the newly proposed metric “aggregate multi-...
Mariam Kaynia, Pedro H. J. Nardell, Paulo Cardieri...
WSCG
2004
106views more  WSCG 2004»
13 years 9 months ago
Recognition of Occluded Objects Using Curvature
New approaches of object representation reliable for partially occluded objects recognition are introduced in this article. Objects are represented by their boundaries, which are ...
Filip Krolupper