1723 search results - page 71 / 345 » Cycling in linear programming problems |
156
Voted
FAW
2007
Springer
15 years 9 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...
128
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
107
click to vote
RC
2007
15 years 2 months ago
2007
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events,...
160
click to vote
TNN
2010
14 years 9 months ago
2010
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
128
click to vote
ENDM
2010
15 years 15 days ago
2010
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...