9842 search results - page 425 / 1969 » The Complexity of the Matching-Cut Problem |
127
click to vote
AIPS
2009
15 years 5 months ago
2009
Distributed POMDPs provide an expressive framework for modeling multiagent collaboration problems, but NEXPComplete complexity hinders their scalability and application in real-wo...
147
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
144
click to vote
COR
2007
15 years 4 months ago
2007
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
134
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
103
click to vote
ENDM
2007
15 years 4 months ago
2007
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...