5624 search results - page 195 / 1125 » On Conditional Covering Problem |
167
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
The present paper is devoted to the study of average consensus problems for undirected networks of dynamic agents having communication delays. By focusing on agents with integrato...
185
click to vote
ENTCS
2006
15 years 6 months ago
2006
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
200
click to vote
JALC
2002
15 years 6 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
163
click to vote
IEEECIT
2010
IEEE
15 years 5 months ago
2010
IEEE
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
204
click to vote
TSMC
2010
15 years 1 months ago
2010
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...