Sciweavers

6 search results - page 1 / 2
» A More Efficient lagrangian Relaxation Approach to Job-Shop ...
Sort
View
ICRA
1995
IEEE
140views Robotics» more  ICRA 1995»
13 years 8 months ago
A More Efficient lagrangian Relaxation Approach to Job-Shop Scheduling Problems
Haoxun Chen, Chengbin Chu, Jean-Marie Proth
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
13 years 9 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
AIPS
2006
13 years 6 months ago
Lemma Reusing for SAT based Planning and Scheduling
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, K...
ICIP
2003
IEEE
14 years 6 months ago
Object-based video compression scheme with optimal bit allocation among shape, motion and texture
In object-based video, the encoding of the video data is decoupled into the encoding of shape, motion and texture information, which enables certain functionalities like content-b...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
ASPDAC
2007
ACM
121views Hardware» more  ASPDAC 2007»
13 years 8 months ago
Timing-Aware Decoupling Capacitance Allocation in Power Distribution Networks
Power supply noise increases the circuit delay, which may lead to performance failure of a design. Decoupling capacitance (decap) addition is effective in reducing the power suppl...
Sanjay Pant, David Blaauw