Sciweavers

1376 search results - page 187 / 276
» Searching Trees: An Essay
Sort
View
JAIR
2011
123views more  JAIR 2011»
15 years 1 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
CPAIOR
2011
Springer
14 years 10 months ago
Almost Square Packing
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
Helmut Simonis, Barry O'Sullivan
NAR
2011
157views Computer Vision» more  NAR 2011»
14 years 9 months ago
PlantTFDB 2.0: update and improvement of the comprehensive plant transcription factor database
We updated the plant transcription factor (TF) database to version 2.0 (PlantTFDB 2.0, http:// planttfdb.cbi.pku.edu.cn) which contains 53 319 putative TFs predicted from 49 speci...
He Zhang, Jinpu Jin, Liang Tang, Yi Zhao, Xiaochen...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 12 months ago
CGP visits the Santa Fe trail: effects of heuristics on GP
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
Cezary Z. Janikow, Christopher J. Mann
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 10 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...