Sciweavers

986 search results - page 91 / 198
» Algorithmic Lower Bounds for Problems Parameterized by Cliqu...
Sort
View
DAC
1996
ACM
15 years 9 months ago
A Hardware/Software Partitioning Algorithm for Designing Pipelined ASIPs with Least Gate Counts
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...
Nguyen-Ngoc Bình, Masaharu Imai, Akichika S...
158
Voted
ANOR
2005
120views more  ANOR 2005»
15 years 5 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
160
Voted
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
15 years 11 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
15 years 5 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
137
Voted
EOR
2007
80views more  EOR 2007»
15 years 5 months ago
A partition approach to the inventory/routing problem
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
Qiu-Hong Zhao, Shouyang Wang, Kin Keung Lai