530 search results - page 31 / 106 » Universal randomized switching |
113
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
141
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
With the current trend in integration of more complex systems on chip there is a need for better communication infrastructure on chip that will increase the available bandwidth an...
151
click to vote
HOTI
2002
IEEE
15 years 8 months ago
2002
IEEE
High-performance input-queued switches require highspeed scheduling algorithms while maintaining good performance. Various round-robin scheduling algorithms for Virtual Output Que...
175
click to vote
Lecture Notes
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
166
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper, we investigate the channel selection strategy for secondary users in cognitive radio networks. We claim that in order to avoid the costly channel switchings, a s...