10988 search results - page 129 / 2198 » Algorithmic Folding Complexity |
128
click to vote
MFCS
2001
Springer
15 years 7 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
154
Voted
SIGGRAPH
1997
ACM
15 years 6 months ago
1997
ACM
Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions. Accurate lighting calculations are typically perfo...
129
click to vote
JMLR
2006
15 years 2 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...
90
Voted
VTC
2008
IEEE
15 years 9 months ago
2008
IEEE
—In this paper, low complexity acquisition of UWB telemetry data packets is addressed. In addition to the usual channel impairments considered of additive white Gaussian noise (A...
127
click to vote
FPGA
1998
ACM
15 years 6 months ago
1998
ACM
In this paper, we present an algorithm for circuit partitioning with complex resource constraints in large FPGAs. Traditional partitioning methods estimate the capacity of an FPGA...