Sciweavers

13271 search results - page 2583 / 2655
» Computers, Programming, and People
Sort
View
FPGA
2007
ACM
150views FPGA» more  FPGA 2007»
15 years 10 months ago
FPGA-friendly code compression for horizontal microcoded custom IPs
Shrinking time-to-market and high demand for productivity has driven traditional hardware designers to use design methodologies that start from high-level languages. However, meet...
Bita Gorjiara, Daniel Gajski
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 10 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
HIPEAC
2007
Springer
15 years 10 months ago
Branch History Matching: Branch Predictor Warmup for Sampled Simulation
Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on today...
Simon Kluyskens, Lieven Eeckhout
ICALP
2007
Springer
15 years 10 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
ICALP
2007
Springer
15 years 10 months ago
Model Theory Makes Formulas Large
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole...
« Prev « First page 2583 / 2655 Last » Next »