Sciweavers

252 search results - page 32 / 51
» On partitions of discrete boxes
Sort
View
SOCO
2010
Springer
13 years 6 months ago
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
Local genetic algorithms have been designed with the aim of providing effective intensification. One of their most outstanding features is that they may help classical local searc...
Carlos García-Martínez, Manuel Lozan...
ICASSP
2011
IEEE
12 years 11 months ago
Optimum multi-user detection by nonsmooth optimization
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
Hoang Duong Tuan, Tran Thai Son, Hoang Tuy, Ha H. ...
AAAI
2010
13 years 9 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...
VIS
2005
IEEE
110views Visualization» more  VIS 2005»
14 years 8 months ago
Prefiltered Gaussian Reconstruction for High-Quality Rendering of Volumetric Data sampled on a Body-Centered Cubic Grid
In this paper a novel high-quality reconstruction scheme is presented. Although our method is mainly proposed to reconstruct volumetric data sampled on an optimal Body-Centered Cu...
Balázs Csébfalvi
COMPGEOM
2000
ACM
14 years 2 hour ago
A trace bound for the hereditary discrepancy
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
Bernard Chazelle, Alexey Lvov