Sciweavers

6142 search results - page 839 / 1229
» The Complexity of Partition Functions
Sort
View
APIN
2002
80views more  APIN 2002»
15 years 6 months ago
Searching a Scalable Approach to Cerebellar Based Control
Decades of research into the structure and function of the cerebellum have led to a clear understanding of many of its cells, as well as how learning might take place. Furthermore...
Jan Peters, P. Patrick van der Smagt
AROBOTS
2002
91views more  AROBOTS 2002»
15 years 6 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
ARTMED
2002
121views more  ARTMED 2002»
15 years 6 months ago
An evolutionary artificial neural networks approach for breast cancer diagnosis
This paper presents an evolutionary artificial neural network approach based on the pareto differential evolution algorithm augmented with local search for the prediction of breas...
Hussein A. Abbass
CORR
2004
Springer
107views Education» more  CORR 2004»
15 years 6 months ago
Encapsulation for Practical Simplification Procedures
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
Olga Shumsky Matlin, William McCune
BSL
2000
153views more  BSL 2000»
15 years 6 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon