Sciweavers

9842 search results - page 1410 / 1969
» Problem complexity
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 7 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
16 years 1 months ago
A destructive evolutionary process: a pilot implementation
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
Joe Sullivan, Conor Ryan
C5
2005
IEEE
16 years 25 days ago
Filters and Tasks in Croquet
Croquet [11,12] is a collaborative 3D platform that allows users to work together to create and share ideas. From the beginning we have worked to ensure that the Croquet interface...
David A. Smith, Andreas Raab, Yoshiki Ohshima, Dav...
IEEEPACT
2005
IEEE
16 years 24 days ago
A Distributed Control Path Architecture for VLIW Processors
VLIW architectures are popular in embedded systems because they offer high-performance processing at low cost and energy. The major problem with traditional VLIW designs is that t...
Hongtao Zhong, Kevin Fan, Scott A. Mahlke, Michael...
LATIN
2010
Springer
15 years 5 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
« Prev « First page 1410 / 1969 Last » Next »