Sciweavers

356 search results - page 34 / 72
» Approximation schemes for the Min-Max Starting Time Problem
Sort
View
SIAMSC
2008
179views more  SIAMSC 2008»
13 years 7 months ago
Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Santi S. Adavani, George Biros
ICMCS
2008
IEEE
148views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Loss tolerance scheme for 3D progressive meshes streaming over networks
– Nowadays, the Internet provides a convenient medium for sharing complex 3D models online. However, transmitting 3D progressive meshes over networks may encounter the problem of...
Hui Li, Ziying Tang, Xiaohu Guo, Balakrishnan Prab...
WWW
2003
ACM
14 years 8 months ago
P2Cast: peer-to-peer patching scheme for VoD service
Providing video on demand (VoD) service over the Internet in a scalable way is a challenging problem. In this paper, we propose P2Cast - an architecture that uses a peer-to-peer a...
Yang Guo, Kyoungwon Suh, James F. Kurose, Donald F...
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...