9842 search results - page 158 / 1969 » The Complexity of the Matching-Cut Problem |
COMCOM
1999
13 years 10 months ago
1999
We study the problem of virtual path layout in ATM networks. Virtual path (VP) and virtual channel are used by the ATM networks in realizing multiplexing, resource management and ...
SOCO
2012
Springer
12 years 5 months ago
2012
Springer
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
WG
1998
Springer
14 years 2 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
FLAIRS
2006
13 years 11 months ago
2006
In today's IT-centric, regulated and competitive environment, businesses rely more heavily on IT technologies. Organizations are often challenged by customers, business partn...
UAI
2004
13 years 11 months ago
2004
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...