The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
This paper has two goals. First, we develop frameworks for logical systems which are able to re ect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning....
—This paper presents a generalized linear quadratic Gaussian and loop transfer recovery method to design an optimal lateral control system for an F-16 aircraft. The traditional l...