4372 search results - page 157 / 875 » Algorithmic Theories of Everything |
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
IJCNN
2000
IEEE
14 years 1 months ago
2000
IEEE
The main purpose of this paper is to compare the support vector machine (SVM) developed by Vapnik with other techniques such as Backpropagation and Radial Basis Function (RBF) Net...
ASIAN
1998
Springer
14 years 1 months ago
1998
Springer
In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities betwe...
GECCO
2010
Springer
14 years 1 months ago
2010
Springer
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
CSR
2007
Springer
14 years 27 days ago
2007
Springer
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...