Sciweavers

400 search results - page 35 / 80
» Extended formulations in combinatorial optimization
Sort
View
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 3 months ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah
CISS
2008
IEEE
15 years 6 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 years 4 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
ICML
2007
IEEE
16 years 18 days ago
Discriminant kernel and regularization parameter learning via semidefinite programming
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
Jieping Ye, Jianhui Chen, Shuiwang Ji
RAS
2006
111views more  RAS 2006»
14 years 11 months ago
Planning under uncertainty using model predictive control for information gathering
This paper considers trajectory planning problems for autonomous robots in information gathering tasks. The objective of the planning is to maximize the information gathered withi...
Cindy Leung, Shoudong Huang, Ngai Ming Kwok, Gamin...