Sciweavers

4377 search results - page 716 / 876
» Mass problems and randomness
Sort
View
GECCO
2004
Springer
15 years 10 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby
GECCO
2004
Springer
15 years 10 months ago
On the Strength of Size Limits in Linear Genetic Programming
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
Nicholas Freitag McPhee, Alex Jarvis, Ellery Fusse...
161
Voted
ILP
2004
Springer
15 years 10 months ago
Learning Ensembles of First-Order Clauses for Recall-Precision Curves: A Case Study in Biomedical Information Extraction
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
LATIN
2004
Springer
15 years 10 months ago
Global Synchronization in Sensornets
Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource con...
Jeremy Elson, Richard M. Karp, Christos H. Papadim...
MWCN
2004
Springer
15 years 10 months ago
A Simple Privacy Extension for Mobile IPV6
In Mobile IPv6, each packet sent and received by a mobile node contains its home address. As a result, it is very easy for an eavesdropper or for a correspondent node to track the ...
Claude Castelluccia, Francis Dupont, Gabriel Monte...