2796 search results - page 222 / 560 » The coolest path problem |
145
click to vote
FCT
1999
Springer
15 years 11 months ago
1999
Springer
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
159
click to vote
DAM
2008
15 years 6 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
181
click to vote
JAIR
2006
15 years 6 months ago
2006
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
165
click to vote
EOR
2007
15 years 6 months ago
2007
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
169
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showe...