Sciweavers

943 search results - page 102 / 189
» How should data structures and algorithms be taught
Sort
View
ICC
2007
IEEE
142views Communications» more  ICC 2007»
14 years 3 months ago
On MAC Scheduling and Packet Combination Strategies for Practical Random Network Coding
— The present paper investigates practical algorithms to efficiently exploit random network coding for data delivery in multi-hop wireless networks. In the past few years, a gre...
Elena Fasolo, Michele Rossi, Jörg Widmer, Mic...
CORR
2011
Springer
189views Education» more  CORR 2011»
13 years 4 months ago
Fast Set Intersection in Memory
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
Bolin Ding, Arnd Christian König
ATAL
2006
Springer
13 years 11 months ago
Selecting informative actions improves cooperative multiagent learning
In concurrent cooperative multiagent learning, each agent simultaneously learns to improve the overall performance of the team, with no direct control over the actions chosen by i...
Liviu Panait, Sean Luke
BMCBI
2006
116views more  BMCBI 2006»
13 years 9 months ago
Cluster analysis for DNA methylation profiles having a detection threshold
Background: DNA methylation, a molecular feature used to investigate tumor heterogeneity, can be measured on many genomic regions using the MethyLight technology. Due to the combi...
Paul Marjoram, Jing Chang, Peter W. Laird, Kimberl...
SOFTVIS
2010
ACM
13 years 9 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...