20638 search results - page 4092 / 4128 » Network Computing |
126
click to vote
CCO
2001
Springer
15 years 6 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
122
Voted
IWDC
2001
Springer
15 years 6 months ago
2001
Springer
Mobile Internet access is becoming extremely popular because users depend on the Internet for many activities in their daily routine. Satellites are well suited for mobile Interne...
117
click to vote
UM
2001
Springer
15 years 6 months ago
2001
Springer
In an experimental environment, we simulated the situation of a user who gives speech input to a system while walking through an airport. The time pressure on the subjects and the ...
118
click to vote
ASYNC
2000
IEEE
15 years 6 months ago
2000
IEEE
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
130
Voted
ICC
2000
IEEE
15 years 6 months ago
2000
IEEE
— In this paper, we propose the use of QoS routing to enhance the support of IP Telephony. Our proposed scheme is based on QoS intradomain OSPF routing, an extension of the conve...