5624 search results - page 175 / 1125 » On Conditional Covering Problem |
139
click to vote
ENDM
2010
15 years 3 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
199
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- This paper deals with the problems of decentralized implementability and decentralized regular implementability in the context of finite-dimensional linear differential ...
134
click to vote
UC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used i...
193
click to vote
JC
2011
15 years 1 months ago
2011
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
182
click to vote
IFIP
2004
Springer
15 years 12 months ago
2004
Springer
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...