1772 search results - page 276 / 355 » Classifying Problems into Complexity Classes |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs—...
IJCAI
2003
2003
Towards Cooperative Negotiation for Decentralized Resource Allocation in Autonomic Computing Systems
13 years 11 months ago
Resource allocation is a key problem in autonomic computing. In this paper we use a data center scenario to motivate the need for decentralization and cooperative negotiation, and...
SIGECOM
2010
ACM
13 years 10 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
CORR
2002
Springer
13 years 10 months ago
2002
Springer
Diagnosing faults in aircraft gas turbine engines is a complex problem. It involves several tasks, including rapid and accurate interpretation of patterns in engine sensor data. W...
COMPGEOM
2007
ACM
14 years 2 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...