Sciweavers

1033 search results - page 159 / 207
» The Relative History Heuristic
Sort
View
ICDM
2005
IEEE
122views Data Mining» more  ICDM 2005»
15 years 5 months ago
Finding Representative Set from Massive Data
In the information age, data is pervasive. In some applications, data explosion is a significant phenomenon. The massive data volume poses challenges to both human users and comp...
Feng Pan, Wei Wang 0010, Anthony K. H. Tung, Jiong...
ICMCS
2005
IEEE
72views Multimedia» more  ICMCS 2005»
15 years 5 months ago
Revenue Aware Preemption Policy in Multimedia Communication Networks
Preemption of low priority call connections to accommodate high priority call connections is a widely recommended technique in a multimedia communication network. A preemption pol...
Iftekhar Ahmad, Joarder Kamruzzaman, Srinivas Aswa...
ICPP
2005
IEEE
15 years 5 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
ICTAI
2005
IEEE
15 years 5 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze
IEEEICCI
2005
IEEE
15 years 5 months ago
Theoretical study on a new information entropy and its use in attribute reduction
The positive region in rough set framework and Shannon conditional entropy are two traditional uncertainty measurements, used usually as heuristic metrics in attribute reduction. ...
Ping Luo, Qing He, Zhongzhi Shi