Sciweavers

383 search results - page 31 / 77
» A new infeasible interior-point algorithm for linear program...
Sort
View
ACTAC
2002
102views more  ACTAC 2002»
13 years 7 months ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
14 years 2 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...
ICALP
2010
Springer
14 years 11 days ago
Streaming Algorithms for Independent Sets
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...
Bjarni V. Halldórsson, Magnús M. Hal...
AIPS
2008
13 years 10 months ago
Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
Abdeslam Boularias, Brahim Chaib-draa
DAC
2009
ACM
14 years 8 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...