Sciweavers

14518 search results - page 217 / 2904
» Two Problems for Sophistication
Sort
View
UAI
1998
15 years 2 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr
113
Voted
ENDM
2006
77views more  ENDM 2006»
15 years 22 days ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...
EOR
2006
70views more  EOR 2006»
15 years 22 days 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
MP
2006
77views more  MP 2006»
15 years 20 days ago
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems
In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigz...
Angel Corberán, Isaac Plana, José M....
DAC
2004
ACM
16 years 1 months ago
Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions
This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subprobl...
Dominic A. Antonelli, Danny Z. Chen, Timothy J. Dy...