54 search results - page 7 / 11 » Linear Time Solvable Optimization Problems on Graphs of Boun... |
MP
2008
13 years 7 months ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
PODS
2007
ACM
14 years 7 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
TSP
2008
13 years 7 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
AAIM
2009
Springer
14 years 2 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
ICDT
2010
ACM
14 years 18 days ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...