6682 search results - page 1243 / 1337 » networks 2006 |
102
Voted
FC
2006
Springer
15 years 4 months ago
2006
Springer
Existing stable matching algorithms reveal the preferences of all participants, as well as the history of matches made and broken in the course of computing a stable match. This in...
120
Voted
FM
2006
Springer
15 years 4 months ago
2006
Springer
Non-determinism of the thread schedule is a well-known problem in concurrent programming. However, other sources of non-determinism exist which cannot be controlled by an applicati...
131
click to vote
FORMATS
2006
Springer
15 years 4 months ago
2006
Springer
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
FPGA
2006
ACM
15 years 4 months ago
2006
ACM
While previous research has shown that FPGAs can efficiently implement many types of computations, their flexibility inherently limits their clock rate. Several research groups ha...
108
Voted
FPGA
2006
ACM
15 years 4 months ago
2006
ACM
In this paper, we present reconfigurable hardware architecture for detecting semantics of streaming data on 1+ Gbps networks. The design leverages on the characteristics of contex...