Sciweavers

894 search results - page 133 / 179
» Game Theory with Costly Computation
Sort
View
CHI
2008
ACM
16 years 2 months ago
Experience sampling for building predictive user models: a comparative study
Experience sampling has been employed for decades to collect assessments of subjects' intentions, needs, and affective states. In recent years, investigators have employed au...
Ashish Kapoor, Eric Horvitz
ICCV
2007
IEEE
15 years 8 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
PRDC
2005
IEEE
15 years 7 months ago
Optimal Choice of Checkpointing Interval for High Availability
Supporting high availability by checkpointing and switching to a backup upon failure of a primary has a cost. Trade-off studies help system architects to decide whether higher ava...
Diana Szentiványi, Simin Nadjm-Tehrani, Joh...
MOBIHOC
2008
ACM
16 years 1 months ago
Delegation forwarding
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
Vijay Erramilli, Mark Crovella, Augustin Chaintrea...
DAC
2004
ACM
16 years 2 months ago
A new heuristic algorithm for reversible logic synthesis
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
Pawel Kerntopf