Sciweavers

4430 search results - page 163 / 886
» Solving Optimization Problems with DLL
Sort
View
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 6 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
15 years 3 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
EOR
2007
78views more  EOR 2007»
15 years 3 months ago
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
Tolga Bektas, Osman Oguz, Iradj Ouveysi
ACSD
2007
IEEE
102views Hardware» more  ACSD 2007»
15 years 9 months ago
Sensor Minimization Problems with Static or Dynamic Observers for Fault Diagnosis
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in...
Franck Cassez, Stavros Tripakis, Karine Altisen
IEEEPACT
2006
IEEE
15 years 9 months ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...