Sciweavers

840 search results - page 138 / 168
» The Complexity of the Extended GCD Problem
Sort
View
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
14 years 3 months ago
Genetically programmed learning classifier system description and results
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
Gregory Anthony Harrison, Eric W. Worden
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
14 years 9 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
IWCIA
2009
Springer
14 years 3 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
BMCBI
2010
91views more  BMCBI 2010»
13 years 9 months ago
Ranked retrieval of Computational Biology models
Background: The study of biological systems demands computational support. If targeting a biological problem, the reuse of existing computational models can save time and effort. ...
Ron Henkel, Lukas Endler, Andre Peters, Nicolas Le...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 2 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen