Sciweavers

7486 search results - page 183 / 1498
» The Limits of Quantum Computers
Sort
View
ACMICEC
2003
ACM
160views ECommerce» more  ACMICEC 2003»
15 years 11 months ago
An algorithm for computing the outcome of combinatorial auctions with proxy bidding
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...
Peter R. Wurman, Gangshu Cai, Jie Zhong, Ashish Su...
DIGRA
2003
Springer
15 years 11 months ago
Characters in Computer Games: Toward Understanding Interpretation and Design
Interpretation of characters is a fundamental feature of human behavior. Even with limited information available, people will assign personality – even to inanimate objects. Cha...
Petri Lankoski, Satu Heliö, Inger Ekman
ICCS
2003
Springer
15 years 11 months ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen
PG
2002
IEEE
15 years 11 months ago
Augmenting Computer Graphics with Haptics for the Visualization of Vessel Networks
Current visualization methods of volume angiograms are limited in their ability to display vessel connectivity and depth information readily available in the data set. In this wor...
Dingrong Yi, Vincent Hayward
AADEBUG
1997
Springer
15 years 10 months ago
Observation and Control for Debugging Distributed Computations
I present a general framework for observing and controlling a distributed computation and its applications to distributed debugging. Algorithms for observation are useful in distr...
Vijay K. Garg