986 search results - page 127 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
141
click to vote
JMLR
2006
15 years 4 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
141
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
127
click to vote
SPIRE
2010
Springer
15 years 2 months ago
2010
Springer
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
160
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
152
click to vote
ICCAD
2009
IEEE
15 years 1 months ago
2009
IEEE
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...