8903 search results - page 154 / 1781 » Alternative |
152
click to vote
APPML
2007
15 years 6 months ago
2007
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
170
Voted
AUTOMATICA
2007
15 years 6 months ago
2007
This paper gives two alternative off-line synthesis approaches to robust model predictive control (RMPC) for systems with polytopic description. In each approach, a sequence of ex...
148
click to vote
DM
2008
15 years 6 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
141
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
In nonmonotonic reasoning, a default conditional has most often been informally interpreted as a defeasible version of a classical conditional, usually the material conditional...
164
Voted
AUTOMATICA
2006
15 years 6 months ago
2006
In this paper we show that the problem of optimal mine planning can be cast in the framework of receding horizon control. Traditional formulations of this problem have cast it in ...