Sciweavers

810 search results - page 36 / 162
» Solving Time-Dependent Planning Problems
Sort
View
CP
2007
Springer
14 years 2 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
CCE
2010
13 years 5 months ago
Green process design, green energy, and sustainability: A systems analysis perspective
This paper presents a systems analysis perspective that extends the traditional process design framework to green process design, green energy and industrial ecology leading to su...
Urmila M. Diwekar, Yogendra N. Shastri
IJCAI
2003
13 years 9 months ago
Multiagent Planning with Partially Ordered Temporal Plans
This paper discusses the specifics of planning in multiagent environments. It presents the formal framework MAPL (“maple”) for describing multiagent planning domains. MAPL al...
Michael Brenner
ICPP
1998
IEEE
14 years 13 days ago
Parallel Algorithms for Airline Crew Planning on Networks of Workstations
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
Christos Goumopoulos, Panayiotis Alefragis, Efthym...
EOR
2006
70views more  EOR 2006»
13 years 8 months ago
A multi-period machine assignment problem
In this paper, a multi-period assignment problem is studied that arises as part of a weekly planning problem at mail processing and distribution centers. These facilities contain ...
Xinhui Zhang, Jonathan F. Bard