Sciweavers

4277 search results - page 232 / 856
» On Multiple Linear Approximations
Sort
View
77
Voted
TROB
2008
112views more  TROB 2008»
14 years 11 months ago
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
Mike Peasgood, Christopher M. Clark, John McPhee
IACR
2011
127views more  IACR 2011»
13 years 10 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 5 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
SI3D
2009
ACM
15 years 5 months ago
Real-time view-dependent rendering of parametric surfaces
We propose a view-dependent adaptive subdivision algorithm for rendering parametric surfaces on parallel hardware. Our framework allows us to bound the screen space error of a pie...
Christian Eisenacher, Quirin Meyer, Charles T. Loo...
GECCO
2008
Springer
170views Optimization» more  GECCO 2008»
15 years 5 days ago
Evolving prediction weights using evolution strategy
The evolution strategy is one of the strongest evolutionary algorithms for optimizing real-value vectors. In this paper, we study how to use it for the evolution of prediction wei...
Trung Hau Tran, Cédric Sanza, Yves Duthen