Sciweavers

14158 search results - page 223 / 2832
» Generalized switch-setting problems
Sort
View
154
Voted
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
15 years 7 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
118
Voted
FLAIRS
2000
15 years 5 months ago
Comparing Performance of Neural Networks Applied to a Simplified Recognition Problem
In this note we present and discuss results of experiments comparing the performance of six neural network architectures (back propagation, recurrent network with dampened feedbac...
Marcin Paprzycki, Rick Niess, Jason Thomas, Lenny ...
145
Voted
ACS
2007
15 years 3 months ago
More on Configurations in Priestley Spaces, and Some New Problems
Abstract. Prohibiting configurations (≡ induced finite connected posets) in Priestley spaces and properties of the associated classes of distributive lattices, and the related ...
Richard N. Ball, Ales Pultr, Jirí Sichler
127
Voted
AMC
2010
126views more  AMC 2010»
15 years 3 months ago
On condition numbers of polynomial eigenvalue problems
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
Nikolaos Papathanasiou, Panayiotis Psarrakos
127
Voted
CORR
2008
Springer
127views Education» more  CORR 2008»
15 years 3 months ago
MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
Liping Qian, Ying Jun Zhang, Jianwei Huang