2446 search results - page 273 / 490 » Choiceless Polynomial Time |
IEEESCC
2005
IEEE
14 years 1 months ago
2005
IEEE
The paradigm of automated e-service composition through the integration of existing services promises a fast and efficient development of new services in cooperative business env...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— With the constraints of network topologies and link capacities, achieving the optimal end-to-end throughput in data networks has been known as a fundamental but computationally...
QSHINE
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusi...
MINENET
2005
ACM
14 years 1 months ago
2005
ACM
Faults in an IP network have various causes such as the failure of one or more routers at the IP layer, fiber-cuts, failure of physical elements at the optical layer, or extraneo...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...