3946 search results - page 407 / 790 » The computational complexity of choice sets |
197
click to vote
ICPP
2002
IEEE
16 years 17 days ago
2002
IEEE
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
204
click to vote
SPAA
2010
ACM
16 years 13 days ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
183
click to vote
FOCS
1993
IEEE
15 years 11 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
187
click to vote
FOCS
1994
IEEE
15 years 11 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
169
click to vote
ANCS
2006
ACM
15 years 11 months ago
2006
ACM
As Intrusion Detection Systems (IDS) utilize more complex syntax to efficiently describe complex attacks, their processing requirements increase rapidly. Hardware and, even more, ...