1845 search results - page 282 / 369 » Machine-Learning Applications of Algorithmic Randomness |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
NOSSDAV
2004
Springer
14 years 1 months ago
2004
Springer
Quality of service for high-bandwidth or delay-sensitive applications in the Internet, such as streaming media and online games, can be significantly improved by replicating serv...
CIKM
2009
Springer
14 years 2 days ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
JPDC
2008
13 years 8 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...