9842 search results - page 1910 / 1969 » Problem complexity |
KDD
2010
ACM
14 years 2 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
APNOMS
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known...
CG
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
CODES
2004
IEEE
14 years 2 months ago
2004
IEEE
The high transistor density afforded by modern VLSI processes have enabled the design of embedded processors that use clustered execution units to deliver high levels of performan...
ATAL
2006
Springer
14 years 2 months ago
2006
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...