9842 search results - page 1553 / 1969 » The Complexity of the Matching-Cut Problem |
204
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— In this paper we study different options for the survivability implementation in MPLS over Optical Transport Networks (OTN) in terms of network resource usage and configuratio...
187
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
194
click to vote
JAIR
2006
15 years 6 months ago
2006
This paper studies bilateral multi-issue negotiation between self-interested autonomous agents. Now, there are a number of different procedures that can be used for this process; ...
211
click to vote
JOT
2008
15 years 6 months ago
2008
The usability of a user interface is often neglected in the design and development of software applications. An Integrated Development Environment (IDE) is prone to poor usability...
194
click to vote
DAM
2007
15 years 6 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...