Sciweavers

233 search results - page 25 / 47
» Computationally feasible VCG mechanisms
Sort
View
PPSN
2010
Springer
13 years 6 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
CG
1999
Springer
13 years 8 months ago
There is more to context than location
Context is a key issue in interaction between human and computer, describing the surrounding facts that add meaning. In mobile computing research published the parameter location ...
Albrecht Schmidt, Michael Beigl, Hans-Werner Gelle...
TMC
2012
11 years 11 months ago
Secure Initialization of Multiple Constrained Wireless Devices for an Unaided User
—A number of protocols and mechanisms have been proposed to address the problem of initial secure key deployment in wireless networks. Most existing approaches work either with a...
Toni Perkovic, Mario Cagalj, Toni Mastelic, Nitesh...
HPCA
2006
IEEE
14 years 9 months ago
ReViveI/O: efficient handling of I/O in highly-available rollback-recovery servers
The increasing demand for reliable computers has led to proposals for hardware-assisted rollback of memory state. Such approach promises major reductions in Mean Time To Repair (M...
Jun Nakano, Pablo Montesinos, Kourosh Gharachorloo...
ACHI
2008
IEEE
14 years 3 months ago
Tailoring Model-Based Techniques to Facial Expression Interpretation
Computers have been widely deployed to our daily lives, but human-computer interaction still lacks intuition. Researchers intend to resolve these shortcomings by augmenting tradit...
Matthias Wimmer, Christoph Mayer, Sylvia Pietzsch,...