4940 search results - page 150 / 988 » On the Complexity of Universal Programs |
116
click to vote
ISCA
2008
IEEE
15 years 11 months ago
2008
IEEE
There is still much performance to be gained by out-of-order processors with wider issue widths. However, traditional methods of increasing issue width do not scale; that is, they...
176
click to vote
FAW
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
133
click to vote
SEMWEB
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...
131
click to vote
ISSS
1997
IEEE
15 years 9 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
145
Voted
EOR
2008
15 years 5 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...