41 search results - page 8 / 9 » Faster Deterministic Sorting and Searching in Linear Space |
ICANN
1997
Springer
13 years 11 months ago
1997
Springer
We use simulated soccer to study multiagent learning. Each team's players (agents) share action set and policy but may behave differently due to position-dependent inputs. All...
ICDE
2004
IEEE
14 years 8 months ago
2004
IEEE
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
ADAEUROPE
2003
Springer
14 years 3 days ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
CPM
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...