Sciweavers

1061 search results - page 52 / 213
» Natural Selection in Relation to Complexity
Sort
View
COCO
2004
Springer
147views Algorithms» more  COCO 2004»
14 years 23 days ago
The Complexity of the Covering Radius Problem on Lattices and Codes
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
Venkatesan Guruswami, Daniele Micciancio, Oded Reg...
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 10 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 11 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
14 years 1 months ago
Configuration of a genetic algorithm for multi-objective optimisation of solar gain to buildings
We report the formulation and implementation of a genetic algorithm to address multi-objective optimisation of solar gain to buildings with the goal of minimising energy consumpti...
Ralph Evins
FINTAL
2006
14 years 20 days ago
Language Model Mixtures for Contextual Ad Placement in Personal Blogs
Abstract. We introduce a method for content-based advertisement selection for personal blog pages, based on combining multiple representations of the blog. The core idea behind the...
Gilad Mishne, Maarten de Rijke