Sciweavers

1029 search results - page 150 / 206
» Neural Networks and Complexity Theory
Sort
View
MOBIHOC
2003
ACM
16 years 3 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
GECCO
2005
Springer
149views Optimization» more  GECCO 2005»
15 years 9 months ago
There's more to a model than code: understanding and formalizing in silico modeling experience
Mapping biology into computation has both a domain specific aspect – biological theory – and a methodological aspect – model development. Computational modelers have implici...
Janet Wiles, Nicholas Geard, James Watson, Kai Wil...
HYBRID
1998
Springer
15 years 8 months ago
High Order Eigentensors as Symbolic Rules in Competitive Learning
We discuss properties of high order neurons in competitive learning. In such neurons, geometric shapes replace the role of classic `point' neurons in neural networks. Complex ...
Hod Lipson, Hava T. Siegelmann
EAAI
2006
123views more  EAAI 2006»
15 years 4 months ago
Applications of artificial intelligence for optimization of compressor scheduling
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...
Hanh H. Nguyen, Christine W. Chan
ML
2006
ACM
110views Machine Learning» more  ML 2006»
15 years 4 months ago
Classification-based objective functions
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
Michael Rimer, Tony Martinez