Sciweavers

1283 search results - page 254 / 257
» Learning Voting Trees
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 9 hour 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...
C5
2004
IEEE
13 years 11 months ago
Skeleton - Easy Simulation System
Skeleton is a visual scripting environment as an extension of Squeak etoy [1] with Connectors [2] system to make mathematical and physical simulation for non professional computer...
Takashi Yamamiya
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 10 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
LREC
2008
180views Education» more  LREC 2008»
13 years 9 months ago
Do we Still Need Gold Standards for Evaluation?
The availability of a huge mass of textual data in electronic format has increased the need for fast and accurate techniques for textual data processing. Machine learning and stat...
Thierry Poibeau, Cédric Messiant
LBM
2007
13 years 9 months ago
Syntactic Features for Protein-Protein Interaction Extraction
Background: Extracting Protein-Protein Interactions (PPI) from research papers is a way of translating information from English to the language used by the databases that store th...
Rune Sætre, Kenji Sagae, Jun-ichi Tsujii