Sciweavers

1950 search results - page 119 / 390
» Varieties of Increasing Trees
Sort
View
149
Voted
IJCAI
2003
15 years 6 months ago
An Improved Algorithm for Optimal Bin Packing
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
Richard E. Korf
INFORMATICALT
2000
96views more  INFORMATICALT 2000»
15 years 4 months ago
Investigation of Dead-Point Situations in the Simulation of Wet Film Evolution
The result of simulation of an idealized thin wet film connecting fixed points in the Euclidean plane is a length-minimizing curve. Gradually increasing the exterior pressure we ar...
Vydunas Saltenis
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 11 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
NAR
2008
103views more  NAR 2008»
15 years 4 months ago
DBD--taxonomically broad transcription factor predictions: new content and functionality
DNA-binding domain (DBD) is a database of predicted sequence-specific DNA-binding transcription factors (TFs) for all publicly available proteomes. The proteomes have increased fr...
Derek Wilson, Varodom Charoensawan, Sarah K. Kumme...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 11 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey