2446 search results - page 190 / 490 » Choiceless Polynomial Time |
134
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
120
click to vote
ISPAN
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
127
click to vote
ACMSE
2005
ACM
15 years 10 months ago
2005
ACM
A key issue in the study of protein signaling networks is understanding the relationships among proteins in the network. Understanding these relationships in the context of a netw...
127
click to vote
CAV
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We address the issue of efficiently automating assume-guarantee reasoning for simulation conformance between finite state systems and specifications. We focus on a non...
122
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...