7047 search results - page 278 / 1410 » Focusing on Binding and Computation |
134
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We foc...
171
click to vote
COMPCON
1994
IEEE
15 years 10 months ago
1994
IEEE
The first product in the Newton family operates under severe constraints in the areas of performance, cost, heat dissipation, power consumption, scalability, size and weight. This...
169
click to vote
FSTTCS
1994
Springer
15 years 10 months ago
1994
Springer
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discus...
165
click to vote
CSR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
150
click to vote
C5
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper focus the need for new educational software environments for exploration of global statistics. We present some concrete examples of highly interactive, non-linear, visu...