Sciweavers

4377 search results - page 580 / 876
» Mass problems and randomness
Sort
View
IJCAI
2007
15 years 8 months ago
Adaptive Genetic Algorithm with Mutation and Crossover Matrices
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the se...
Nga Lam Law, Kwok Yip Szeto
IJCAI
2007
15 years 8 months ago
Optimal Soft Arc Consistency
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...
Martin C. Cooper, Simon de Givry, Thomas Schiex
ICISC
2004
147views Cryptology» more  ICISC 2004»
15 years 8 months ago
Batch Verifications with ID-Based Signatures
An identity (ID)-based signature scheme allows any pair of users to verify each other's signatures without exchanging public key certificates. With the advent of Bilinear maps...
HyoJin Yoon, Jung Hee Cheon, Yongdae Kim
NIPS
2001
15 years 8 months ago
Model-Free Least-Squares Policy Iteration
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
Michail G. Lagoudakis, Ronald Parr
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 8 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro