420 search results - page 59 / 84 » Some Algorithmic Problems in Polytope Theory |
ICTAI
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
106
click to vote
TIP
2002
14 years 9 months ago
2002
Abstract--Additive noise removal from a given signal is an important problem in signal processing. Among the most appealing aspects of this field are the ability to refer it to a w...
SSS
2010
Springer
14 years 8 months ago
2010
Springer
The earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on a...
WAOA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
103
click to vote
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...