4843 search results - page 495 / 969 » The Shortcut Problem - Complexity and Approximation |
170
click to vote
SAT
2010
Springer
15 years 10 months ago
2010
Springer
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
181
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
153
click to vote
EDBTW
2006
Springer
15 years 10 months ago
2006
Springer
The wavelet decomposition is a proven tool for constructing concise synopses of massive data sets and rapid changing data streams, which can be used to obtain fast approximate, wit...
176
click to vote
WSC
2008
15 years 9 months ago
2008
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
145
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routi...