Sciweavers

2681 search results - page 173 / 537
» Problem F
Sort
View
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
14 years 4 months ago
The truncated fourier transform and applications
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
Joris van der Hoeven
COMPGEOM
2003
ACM
14 years 4 months ago
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Nina Amenta, Sunghee Choi, Günter Rote
SIGECOM
2003
ACM
119views ECommerce» more  SIGECOM 2003»
14 years 4 months ago
Preference elicitation in proxied multiattribute auctions
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
Aditya V. Sunderam, David C. Parkes
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
14 years 2 months ago
Structure and metaheuristics
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
Yossi Borenstein, Riccardo Poli
FOGA
2011
13 years 2 months ago
The logarithmic hypervolume indicator
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
Tobias Friedrich, Karl Bringmann, Thomas Voß...