Sciweavers

9698 search results - page 1777 / 1940
» models 2010
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 1 months ago
Finding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
CORR
2010
Springer
163views Education» more  CORR 2010»
15 years 1 months ago
Toward a Push-Scalable Global Internet
Push message delivery, where a client maintains an "always-on" connection with a server in order to be notified of a (asynchronous) message arrival in real-time, is incre...
Sachin Agarwal
CROSSROADS
2010
15 years 1 months ago
Massive multiplayer human computation for fun, money, and survival
Crowdsourcing is an effective tool to solve hard tasks. By bringing 100,000s of people to work on simple tasks that only humans can do, we can go far beyond traditional models of ...
Lukas Biewald
DALT
2010
Springer
15 years 1 months ago
Executing Specifications of Social Reasoning Agents
Social reasoning theories, whilst studied extensively in the area of multiagent systems, are hard to implement directly in agents. They often specify properties of beliefs or behav...
Iain Wallace, Michael Rovatsos
DC
2010
15 years 1 months ago
Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
Robert Danek, Wojciech M. Golab
« Prev « First page 1777 / 1940 Last » Next »