Sciweavers

233 search results - page 22 / 47
» On Some Optimization Heuristics for Lesk-Like WSD Algorithms
Sort
View
IAT
2005
IEEE
16 years 5 days ago
Decomposition Techniques for a Loosely-Coupled Resource Allocation Problem
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
AAAI
1994
15 years 7 months ago
Improving Learning Performance Through Rational Resource Allocation
This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning...
Jonathan Gratch, Steve A. Chien, Gerald DeJong
ATAL
2007
Springer
16 years 22 days ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
16 years 22 days ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
JAIR
2008
145views more  JAIR 2008»
15 years 6 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein