4865 search results - page 661 / 973 » The Complexity of Graph Connectivity |
146
Voted
PKC
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
158
click to vote
UML
2000
Springer
15 years 8 months ago
2000
Springer
Software testing can only be formalized and quanti ed when a solid basis for test generation can be de ned. Tests are commonly generated from program source code, graphical models ...
161
Voted
FPGA
1995
ACM
15 years 8 months ago
1995
ACM
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
148
Voted
SC
1991
ACM
15 years 8 months ago
1991
ACM
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
151
click to vote
AAAI
2007
15 years 7 months ago
2007
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...