2157 search results - page 81 / 432 » Optimal Fast Hashing |
173
click to vote
DATE
2004
IEEE
15 years 7 months ago
2004
IEEE
For successful SoC design, efficient and scalable communication architecture is crucial. Some bus interconnects now provide configurable structures to meet this requirement of an ...
135
click to vote
ATMOS
2007
15 years 5 months ago
2007
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
154
click to vote
ISCAPDCS
2004
15 years 5 months ago
2004
Internet today, has transformed into a global information hub. The increase in its usage and magnitude have sparkled various research problems. Because of the diverse user populat...
145
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
134
click to vote
ICS
2009
Tsinghua U.
15 years 11 months ago
2009
Tsinghua U.
The Cell BE is a multicore processor with eight vector accelerators (called SPEs) that implement explicit cache management through direct memory access engines. While the Cell has...