1064 search results - page 58 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
121
click to vote
VLDB
1999
ACM
15 years 8 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
153
click to vote
ACSAC
2007
IEEE
15 years 8 months ago
2007
IEEE
Relay nodes are a potential threat to networks since they are used in many malicious situations like stepping stone attacks, botnet communication, peer-to-peer streaming etc. Quic...
136
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
153
click to vote
HYBRID
2000
Springer
15 years 7 months ago
2000
Springer
A problem of great interest in the control of hybrid systems is the design of least restrictive controllers for reachability specifications. Controller design typically uses game t...
137
click to vote
AUTOMATICA
2004
15 years 3 months ago
2004
Ellipsoidal outer-bounding of the set of all feasible state vectors under model uncertainty is a natural extension of state estimation for deterministic models with unknown-but-bo...