1568 search results - page 77 / 314 » The problem of examination questions in algorithmics |
138
Voted
ISCC
2008
IEEE
15 years 10 months ago
2008
IEEE
This work addresses the high-rate session scheduling problem in Fractional Lambda Switching (FλS) networks. With its global phase synchronization and pipeline forwarding (PF) ope...
109
Voted
TRIDENTCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
Several difficulties arise when testing network security algorithms. First, using network data captured at a router does not guarantee that any instances of the security event of...
116
click to vote
CHI
2001
ACM
16 years 4 months ago
2001
ACM
The advent of second-generation intelligent computer tutors raises an important instructional design question: when should tutorial advice be presented in problem solving? This pa...
174
click to vote
SPAA
1994
ACM
15 years 8 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
255
click to vote
AIR
2002
15 years 4 months ago
2002
The rapid advances of evolutionary methods for multi-objective (MO) optimization poses the difficulty of keeping track of the developments in this field as well as selecting an app...