Sciweavers

221 search results - page 7 / 45
» The cost of not knowing the radius
Sort
View
CORR
2012
Springer
229views Education» more  CORR 2012»
12 years 3 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat
TON
2010
221views more  TON 2010»
13 years 2 months ago
Minimum-Cost Multiple Paths Subject to Minimum Link and Node Sharing in a Network
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
S. Q. Zheng, Jianping Wang, Bing Yang, Mei Yang
ECCC
2010
80views more  ECCC 2010»
13 years 7 months ago
Query Complexity in Errorless Hardness Amplification
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
Thomas Watson
AAAI
2007
13 years 9 months ago
Learning Equilibrium in Resource Selection Games
We consider a resource selection game with incomplete information about the resource-cost functions. All the players know is the set of players, an upper bound on the possible cos...
Itai Ashlagi, Dov Monderer, Moshe Tennenholtz
VLDB
2007
ACM
121views Database» more  VLDB 2007»
14 years 7 months ago
TRAX - Real-World Tracking of Moving Objects
A range of mobile services rely on knowing the current positions of populations of so-called moving objects. In the ideal setting, the positions of all objects are known always an...
Christian S. Jensen, Stardas Pakalnis