4526 search results - page 191 / 906 » Algorithmic problems related to the Internet |
148
Voted
ICAISC
2010
Springer
15 years 6 months ago
2010
Springer
The problem of finding optimal locations of base stations, their pilot powers and channel assignments in UMTS mobile networks belongs to a class of NP-hard problems, and hence, me...
273
click to vote
AACC
2004
Springer
15 years 10 months ago
2004
Springer
Searching on the Internet has grown in importance over the last few years, as huge amount of information is invariably accumulated on the Web. The problem involves locating the des...
137
click to vote
TON
2002
15 years 4 months ago
2002
In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, the IETF has been considering the deployment of active queue management tech...
149
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
156
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Multimedia object caching, by which the same multimedia object can be adapted to diverse mobile appliances through the technique of transcoding, is an important technology for imp...