2092 search results - page 347 / 419 » A Theory of Non-Deterministic Networks |
CHI
2009
ACM
15 years 12 months ago
2009
ACM
Contemporary work increasingly involves interacting with strangers in technology-mediated environments. In this context, we come to rely on digital artifacts to infer characterist...
167
click to vote
SIGMOD
2009
ACM
15 years 11 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
104
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
VLSI research, in its continuous push toward further miniaturisation, is seeking to break through the limitations of current circuit manufacture techniques by moving towards biomi...
P2P
2008
IEEE
15 years 5 months ago
2008
IEEE
Peer-to-peer file-sharing networks depend on peers uploading data to each other. Some peers, called free-riders, will not upload data unless there is an incentive to do so. Algor...