Sciweavers

3007 search results - page 307 / 602
» Linear Functional Fixed-points
Sort
View
CADE
1990
Springer
15 years 8 months ago
A Theorem Prover for a Computational Logic
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
Robert S. Boyer, J. Strother Moore
FGR
2004
IEEE
130views Biometrics» more  FGR 2004»
15 years 7 months ago
Sparse Models for Gender Classification
A class of sparse regularization functions are considered for the developing sparse classifiers for determining facial gender. The sparse classification method aims to both select...
Nicholas Costen, Martin Brown, Shigeru Akamatsu
GECCO
2006
Springer
196views Optimization» more  GECCO 2006»
15 years 7 months ago
An anticipatory approach to improve XCSF
XCSF is a novel version of learning classifier systems (LCS) which extends the typical concept of LCS by introducing computable classifier prediction. In XCSF Classifier predictio...
Amin Nikanjam, Adel Torkaman Rahmani
AAAI
2007
15 years 6 months ago
Optimal Multi-Agent Scheduling with Constraint Programming
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
Willem Jan van Hoeve, Carla P. Gomes, Bart Selman,...
118
Voted
ASIACRYPT
2008
Springer
15 years 6 months ago
Speeding Up the Pollard Rho Method on Prime Fields
Abstract. We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho alg...
Jung Hee Cheon, Jin Hong, Minkyu Kim