Sciweavers

6894 search results - page 64 / 1379
» Generation Problems
Sort
View
COR
2008
60views more  COR 2008»
15 years 5 months ago
Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patterns
An approach is proposed for generating homogenous three-staged cutting patterns for the constrained two-dimensional guillotinecutting problems of rectangles. It is based on branch...
Yaodong Cui
WSC
2007
15 years 8 months ago
Automatic generation of simulation models for semiconductor manufacturing
This article gives an overview of a framework for automatically generating large-scale simulation models from a domain specific problem definition data schema, here semiconductor ...
Ralph Mueller, Christos Alexopoulos, Leon F. McGin...
SP
2008
IEEE
16 years 16 days ago
Automatic Patch-Based Exploit Generation is Possible: Techniques and Implications
The automatic patch-based exploit generation problem is: given a program P and a patched version of the program P′ , automatically generate an exploit for the potentially unknow...
David Brumley, Pongsin Poosankam, Dawn Xiaodong So...
TCAD
2002
93views more  TCAD 2002»
15 years 5 months ago
Hierarchical buffered routing tree generation
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
Amir H. Salek, Jinan Lou, Massoud Pedram
EVOW
2007
Springer
16 years 10 days ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu