Sciweavers

2631 search results - page 343 / 527
» A Practical Method for the Sparse Resultant
Sort
View
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 years 9 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
ICLP
1997
Springer
15 years 8 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
15 years 8 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
148
Voted
SAS
1991
Springer
15 years 8 months ago
On Static Properties of Specialized Programs
Specializing programs by partial evaluation is well defined extensionally, but in practice no intensional properties, such as what the specialized programs will look like or how ...
Karoline Malmkjær
DSN
2005
IEEE
15 years 6 months ago
Combining Response Surface Methodology with Numerical Models for Optimization of Class-Based Queueing Systems
In general, decision support is one of the main purposes of model-based analysis of systems. Response surface methodology (RSM) is an optimization technique that has been applied ...
Peter Kemper, Dennis Müller, Axel Thümml...