4488 search results - page 594 / 898 » Properties of NP-Complete Sets |
168
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper suggests that, to match an ideal Internet gateway which rigorously enforces fair sharing among competing TCP connections, an ideal TCP sender should possess two propert...
183
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is t...
196
click to vote
VISUALIZATION
1997
IEEE
15 years 11 months ago
1997
IEEE
Recursive subdivision schemes have been extensively used in computer graphics and scientific visualization for modeling smooth surfaces of arbitrary topology. Recursive subdivisi...
225
click to vote
PODS
1994
ACM
15 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
193
click to vote
TACS
1994
Springer
15 years 11 months ago
1994
Springer
In the A-calculus, there is a standard notion of what terms should be considered to be "undefined": the unsolvable terms. There are various equivalent characterisations o...