Sciweavers

3381 search results - page 648 / 677
» LEO - DB2's LEarning Optimizer
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 1 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
GI
1998
Springer
14 years 29 days ago
Self-Organizing Data Mining
"KnowledgeMiner" was designed to support the knowledge extraction process on a highly automated level. Implemented are 3 different GMDH-type self-organizing modeling algo...
Frank Lemke, Johann-Adolf Müller
PLDI
2010
ACM
14 years 25 days ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
GECCO
2007
Springer
206views Optimization» more  GECCO 2007»
14 years 18 days ago
Using code metric histograms and genetic algorithms to perform author identification for software forensics
We have developed a technique to characterize software developers' styles using a set of source code metrics. This style fingerprint can be used to identify the likely author...
Robert Charles Lange, Spiros Mancoridis
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 18 days ago
Evolving distributed agents for managing air traffic
Air traffic management offers an intriguing real world challenge to designing large scale distributed systems using evolutionary computation. The ability to evolve effective air t...
Adrian K. Agogino, Kagan Tumer