Sciweavers

692 search results - page 85 / 139
» Some research questions for computational transportation sci...
Sort
View
SPAA
2005
ACM
15 years 3 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
GI
2010
Springer
14 years 8 months ago
Is it Possible to Interact with a Handheld Device While Holding it in Both Hands?
Abstract: Intuitiveness, attractiveness and efficiency are in general important characteristics of high quality User Interfaces (UI). In the case of a Mass Casualty Incident (MCI)...
Tayfur Coskun, Eva Artinger, Simon Nestler, Amal B...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 2 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
TISSEC
2010
237views more  TISSEC 2010»
14 years 4 months ago
BLAC: Revoking Repeatedly Misbehaving Anonymous Users without Relying on TTPs
Several credential systems have been proposed in which users can authenticate to service providers anonymously. Since anonymity can give users the license to misbehave, some varia...
Patrick P. Tsang, Man Ho Au, Apu Kapadia, Sean W. ...
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
15 years 10 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...