Sciweavers

6693 search results - page 977 / 1339
» On an anytime algorithm for control
Sort
View
SI3D
2005
ACM
15 years 9 months ago
What you see is what you snap: snapping to geometry deformed on the GPU
We present a simple yet effective snapping technique for constraining the motion of the cursor of an input device to the surface of 3D models whose geometry is arbitrarily deforme...
Harlen Costa Batagelo, Shin-Ting Wu
STORAGESS
2005
ACM
15 years 9 months ago
Security of erasable memories against adaptive adversaries
We study cryptographic modeling and encryption-based design techniques for guaranteeing privacy of data that is first stored in some type of computer memory and then deleted. We ...
Giovanni Di Crescenzo
203
Voted
WOWMOM
2005
ACM
240views Multimedia» more  WOWMOM 2005»
15 years 9 months ago
An Adaptive Routing Protocol for Ad Hoc Peer-to-Peer Networks
Ad hoc networks represent a key factor in the evolution of wireless communications. These networks typically consist of equal nodes that communicate without central control, inter...
Luca Gatani, Giuseppe Lo Re, Salvatore Gaglio
ATAL
2005
Springer
15 years 9 months ago
A distributed framework for solving the Multiagent Plan Coordination Problem
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
Jeffrey S. Cox, Edmund H. Durfee, Thomas Bartold
FORMATS
2005
Springer
15 years 9 months ago
Average Reward Timed Games
We consider real-time games where the goal consists, for each player, in maximizing the average amount of reward he or she receives per time unit. We consider zero-sum rewards, so ...
B. Thomas Adler, Luca de Alfaro, Marco Faella