Sciweavers

1662 search results - page 88 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 10 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
ENTCS
2008
102views more  ENTCS 2008»
13 years 9 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
ETRA
2006
ACM
136views Biometrics» more  ETRA 2006»
14 years 2 months ago
Computational mechanisms for gaze direction in interactive visual environments
Next-generation immersive virtual environments and video games will require virtual agents with human-like visual attention and gaze behaviors. A critical step is to devise effic...
Robert J. Peters, Laurent Itti
FGCS
2007
160views more  FGCS 2007»
13 years 8 months ago
Distributed data mining in grid computing environments
The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an e...
Ping Luo, Kevin Lü, Zhongzhi Shi, Qing He
ATAL
2009
Springer
14 years 3 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...