Sciweavers

4498 search results - page 53 / 900
» How to Invent Functions
Sort
View
IJAR
2002
109views more  IJAR 2002»
13 years 7 months ago
The application of the matrix calculus to belief functions
The mathematics of belief functions can be handled with the use of the matrix notation. This representation helps greatly the user thanks to its notational simplicity and its effi...
Philippe Smets
ICTAC
2007
Springer
14 years 1 months ago
Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
Abstract. Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan, Cha...
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 9 months ago
Black-box optimization benchmarking for noiseless function testbed using artificial bee colony algorithm
This paper benchmarks the Artificial Bee Colony (ABC) algorithm using the noise-free BBOB 2010 testbed. The results show how this algorithm is highly successful in the separable a...
Mohammed El-Abd
PARCO
2007
13 years 9 months ago
Visualizing Parallel Functional Program Runs: Case Studies with the Eden Trace Viewer
executions in terms of Eden’s abstract units of computation instead of providing a machineoriented low level view like common tools for parallelism analysis do. We show how typic...
Jost Berthold, Rita Loogen
TCS
2010
13 years 6 months ago
Maximal width learning of binary functions
This paper concerns learning binary-valued functions defined on IR, and investigates how a particular type of ‘regularity’ of hypotheses can be used to obtain better generali...
Martin Anthony, Joel Ratsaby