Sciweavers

952 search results - page 92 / 191
» Computational complexity of stochastic programming problems
Sort
View
119
Voted
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
15 years 6 months ago
Genetically programmed learning classifier system description and results
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
Gregory Anthony Harrison, Eric W. Worden
AUTOMATICA
2007
124views more  AUTOMATICA 2007»
15 years 23 days ago
Motion planning in uncertain environments with vision-like sensors
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
Suman Chakravorty, John L. Junkins
ICLP
2004
Springer
15 years 6 months ago
Non-viability Deductions in Arc-Consistency Computation
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
Camilo Rueda, Frank D. Valencia
ICDCS
1991
IEEE
15 years 4 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
ACMACE
2006
ACM
15 years 6 months ago
Motivated reinforcement learning for non-player characters in persistent computer game worlds
Massively multiplayer online computer games are played in complex, persistent virtual worlds. Over time, the landscape of these worlds evolves and changes as players create and pe...
Kathryn Elizabeth Merrick, Mary Lou Maher