303 search results - page 54 / 61 » Discrete Mathematics for Computer Science, Some Notes |
ELPUB
2008
ACM
13 years 9 months ago
2008
ACM
Academics, having written their peer reviewed articles, may at some stage in the make their work Open Access (OA). They can do this by self-archiving an electronic version of thei...
ENTCS
2006
13 years 7 months ago
2006
Latency insensitive protocols (LIPs) have been proposed as a viable means to connect synchronous IP blocks via long interconnects in a system-on-chip. The reason why one needs to ...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...