1263 search results - page 223 / 253 » A* with Bounded Costs |
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
CP
2004
Springer
14 years 1 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
Endowing agents with “social rationality” [10, 12, 11] can aid overall efficiency in tasks where cooperation is beneficial to system level performance. However it is difficult...
ICNP
2002
IEEE
14 years 28 days ago
2002
IEEE
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
STOC
2010
ACM
14 years 25 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...