Sciweavers

422 search results - page 61 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
CPAIOR
2007
Springer
14 years 2 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
TASE
2011
IEEE
13 years 9 days ago
Multiresource Shop Scheduling With Resource Flexibility and Blocking
—This paper proposes a general scheduling model that extends job-shop scheduling models to incorporate important features of real manufacturing systems. More precisely, each oper...
Yazid Mati, Xiaolan Xie
TWC
2011
291views more  TWC 2011»
13 years 3 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...
INFOCOM
2005
IEEE
14 years 2 months ago
Topology aware overlay networks
— Recently, overlay networks have emerged as a means to enhance end-to-end application performance and availability. Overlay networks attempt to leverage the inherent redundancy ...
Junghee Han, David Watson, Farnam Jahanian
AI
2011
Springer
13 years 3 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...