Sciweavers

2446 search results - page 151 / 490
» Choiceless Polynomial Time
Sort
View
86
Voted
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
15 years 4 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi
CP
2006
Springer
15 years 4 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider
110
Voted
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
15 years 2 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
122
Voted
IPCO
2004
142views Optimization» more  IPCO 2004»
15 years 2 months ago
The Constrained Minimum Weighted Sum of Job Completion Times Problem
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weigh...
Asaf Levin, Gerhard J. Woeginger
97
Voted
ISQED
2010
IEEE
177views Hardware» more  ISQED 2010»
15 years 7 months ago
Multi-corner, energy-delay optimized, NBTI-aware flip-flop design
With the CMOS transistors being scaled to sub 45nm and lower, Negative Bias Temperature Instability (NBTI) has become a major concern due to its impact on PMOS transistor aging pr...
Hamed Abrishami, Safar Hatami, Massoud Pedram