Sciweavers

1566 search results - page 168 / 314
» On a Cone Covering Problem
Sort
View
IFIPTCS
2010
15 years 2 months ago
A Game-Theoretic Approach to Routing under Adversarial Conditions
Abstract. We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termi...
James Gross, Frank G. Radmacher, Wolfgang Thomas
ICWL
2009
Springer
15 years 2 months ago
Using the Social Web to Supplement Classical Learning
Abstract. The paper describes a complex e-learning experiment that has involved over 700 students that attended the Human-Computer Interaction course at the "Politehnica"...
Stefan Trausan-Matu, Vlad Posea, Traian Rebedea, C...
CSCW
2012
ACM
14 years 5 days ago
DiscoTech: a plug-in toolkit to improve handling of disconnection and reconnection in real-time groupware
Disconnection and reconnection are common problems for users of synchronous groupware, but these problems are not easy for developers to handle because of the wide range of scenar...
Banani Roy, T. C. Nicholas Graham, Carl Gutwin
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
16 years 4 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
COMCOM
2006
168views more  COMCOM 2006»
15 years 4 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen