4843 search results - page 209 / 969 » The Shortcut Problem - Complexity and Approximation |
136
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
This paper introduces a gradient-based reward prediction update mechanism to the XCS classifier system as applied in neuralnetwork type learning and function approximation mechani...
128
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
We consider a class of restless multi-armed bandit problems that arises in multi-channel opportunistic communications, where channels are modeled as independent and stochastically...
108
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
101
Voted
FLAIRS
2003
15 years 4 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
115
click to vote
IJCAI
2003
15 years 4 months ago
2003
We address the task of problem determination in a distributed system using probes, or test transactions, which gather information about system components. Effective probing requir...