Sciweavers

4435 search results - page 540 / 887
» Algorithms, games, and the internet
Sort
View
ICALP
1994
Springer
15 years 11 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
SIGGRAPH
2010
ACM
15 years 10 months ago
A deformation transformer for real-time cloth animation
Achieving interactive performance in cloth animation has significant implications in computer games and other interactive graphics applications. Although much progress has been m...
Wei-Wen Feng, Yizhou Yu, Byung-Uck Kim
ATAL
2006
Springer
15 years 10 months ago
Reducing price fluctuation in continuous double auctions through pricing policy and shout improvement
Auction mechanism design is a subfield of game theory dedicated to manipulating the rules of an auction so as to achieve specific goals. The complexity of the dynamics of auctions...
Jinzhong Niu, Kai Cai, Simon Parsons, Elizabeth Sk...
ATAL
2006
Springer
15 years 10 months ago
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation
Abstract. We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to retain much of their private valuation information, yet generates close-...
Tuomas Sandholm, Andrew Gilpin
CW
2004
IEEE
15 years 10 months ago
Peer-to-Peer Networked Field-type Virtual Environment by Using AtoZ
This paper aims to study how to gain the consistency of the state in a DVE (Distributed Virtual Environment) with lag, under the condition of peer-to-peer architecture. That is, w...
Tatsuhiro Yonekura, Yoshihiro Kawano, Dai Hanawa