Sciweavers

692 search results - page 27 / 139
» Why Experimentation can be better than
Sort
View
IPPS
1998
IEEE
15 years 5 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
ECML
2004
Springer
15 years 5 months ago
Efficient Hyperkernel Learning Using Second-Order Cone Programming
The kernel function plays a central role in kernel methods. Most existing methods can only adapt the kernel parameters or the kernel matrix based on empirical data. Recently, Ong e...
Ivor W. Tsang, James T. Kwok
WWW
2010
ACM
15 years 8 months ago
Live web search experiments for the rest of us
There are significant barriers to academic research into user Web search preferences. Academic researchers are unable to manipulate the results shown by a major search engine to ...
Timothy Jones, David Hawking, Ramesh S. Sankaranar...
ATAL
2011
Springer
14 years 1 months ago
Using iterated reasoning to predict opponent strategies
The field of multiagent decision making is extending its tools from classical game theory by embracing reinforcement learning, statistical analysis, and opponent modeling. For ex...
Michael Wunder, Michael Kaisers, John Robert Yaros...
WWW
2007
ACM
16 years 2 months ago
A clustering method for web data with multi-type interrelated components
Traditional clustering algorithms work on "flat" data, making the assumption that the data instances can only be represented by a set of homogeneous and uniform features...
Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee G...