Sciweavers

2925 search results - page 73 / 585
» Information Complexity of Online Problems
Sort
View
INFOCOM
2002
IEEE
15 years 11 months ago
Travelling Miser Problem
— Various monitoring and performance evaluation tools generate considerable amount of low priority traffic. This information is not always needed in real time, and thus could of...
Yuval Shavitt, David Breitgand, Danny Raz
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 10 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
IADIS
2004
15 years 7 months ago
Problem Based Learning in the Digital Age: A Case Study on Digital Entertainment
While the digital age is based on computing, computing disciplines remain conservative in their curricula and delivery methods. Computer science and information systems curricula ...
Janet Aisbett, Greg Gibbon
ICMCS
2006
IEEE
148views Multimedia» more  ICMCS 2006»
16 years 4 days ago
Directing Attention in Online Aggregate Sensor Streams via Auditory Blind Value Assignment
Multiparty collaborative applications in which groups of people act in concert to achieve some real-world goal abound. In these situations, it is useful for a central planning age...
Robert Malkin, Datong Chen, Jie Yang, Alex Waibel
144
Voted
ECIS
2003
15 years 7 months ago
Using online services in untrusted environments: a privacy-preserving architecture
While online service providers are sometimes accused of forwarding identifying customer information as name and address to untrusted third parties, comparatively little attention ...
Claus Boyens, Oliver Günther