Sciweavers

1161 search results - page 196 / 233
» Approximation schemes for clustering problems
Sort
View
CCE
2004
13 years 7 months ago
Optimization under uncertainty: state-of-the-art and opportunities
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
Nikolaos V. Sahinidis
CDC
2010
IEEE
138views Control Systems» more  CDC 2010»
13 years 2 months ago
Sensor-based robot deployment algorithms
Abstract-- In robot deployment problems, the fundamental issue is to optimize a steady state performance measure that depends on the spatial configuration of a group of robots. For...
Jerome Le Ny, George J. Pappas
INFOCOM
2006
IEEE
14 years 1 months ago
Dual-Resource TCP/AQM for Processing-Constrained Networks
— This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even r...
Minsu Shin, Song Chong, Injong Rhee
WSCG
2003
166views more  WSCG 2003»
13 years 9 months ago
View-Dependent Multiresolution Model For Foliage
Real-time rendering of vegetation is one of the most important challenges in outdoor scenes. This is due to the vast amount of polygons that are used to model vegetable species. M...
Inmaculada Remolar, Miguel Chover, José Rib...
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 7 months ago
A Unified View of TD Algorithms; Introducing Full-Gradient TD and Equi-Gradient Descent TD
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
Manuel Loth, Philippe Preux