Sciweavers

9949 search results - page 77 / 1990
» On the Network Complexity of Selection
Sort
View
CCGRID
2008
IEEE
14 years 3 months ago
Joint Communication and Computation Task Scheduling in Grids
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...
MCS
2000
Springer
14 years 13 days ago
Classifier Instability and Partitioning
Various methods exist for reducing correlation between classifiers in a multiple classifier framework. The expectation is that the composite classifier will exhibit improved perfor...
Terry Windeatt
WOA
2001
13 years 10 months ago
Implementing Adaptive Capabilities on Agents that Act in a Dynamic Environment
Acting in a dynamic environment is a complex task that requires several issues to be investigated, with the aim of controlling the associated search complexity. In this paper, a l...
Giuliano Armano, Giancarlo Cherchi, Eloisa Vargiu
BMCBI
2008
136views more  BMCBI 2008»
13 years 9 months ago
A comparison of machine learning algorithms for chemical toxicity classification using a simulated multi-scale data model
Background: Bioactivity profiling using high-throughput in vitro assays can reduce the cost and time required for toxicological screening of environmental chemicals and can also r...
Richard Judson, Fathi Elloumi, R. Woodrow Setzer, ...
IIHMSP
2006
IEEE
131views Multimedia» more  IIHMSP 2006»
14 years 2 months ago
Decoder-Friendly Subpel MV Selection for H.264/AVC Video Encoding
— A decoder-friendly subpel motion vector (MV) selection scheme for H.264/AVC video encoding is proposed in this work. First, the rate-distortion (RD) relationship with respect t...
Qi Zhang, Yunyang Dai, Siwei Ma, C. C. Jay Kuo