Sciweavers

1568 search results - page 219 / 314
» The problem of examination questions in algorithmics
Sort
View
CHI
2006
ACM
16 years 6 months ago
Using intelligent task routing and contribution review to help communities build artifacts of lasting value
Many online communities are emerging that, like Wikipedia, bring people together to build community-maintained artifacts of lasting value (CALVs). Motivating people to contribute ...
Dan Cosley, Dan Frankowski, Loren G. Terveen, John...
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
16 years 6 months ago
On metric ramsey-type phenomena
The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Gi...
Yair Bartal, Nathan Linial, Manor Mendel, Assaf Na...
SAC
2009
ACM
16 years 1 months ago
Optimal service level allocation in environmentally powered embedded systems
Energy management is a critical concern in the design of embedded systems to prolong the lifetime or to maximize the performance under energy constraints. In particular, the emerg...
Clemens Moser, Jian-Jia Chen, Lothar Thiele
CSL
2009
Springer
16 years 28 days ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
16 years 28 days ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd