721 search results - page 15 / 145 » On Generators of Random Quasigroup Problems |
84
Voted
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
This study examines the utility of grammatical ephemeral random constants, and conducts an analysis of the preferences of evolutionary search when a number of different grammar ba...
171
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
COCO
2004
Springer
15 years 5 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
113
click to vote
COLOGNETWENTE
2010
14 years 10 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
JMLR
2010
14 years 6 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...