Sciweavers

673 search results - page 85 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
CP
2001
Springer
14 years 5 days ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken
SAC
2010
ACM
14 years 2 months ago
Constraint-based LN-curves
We consider the design of parametric curves from geometric constraints such as distance from lines or points and tangency to lines or circles. We solve the Hermite problem with su...
Young Joon Ahn, Christoph M. Hoffmann
CCE
2004
13 years 7 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
PIMRC
2008
IEEE
14 years 2 months ago
An optimization framework for the joint routing and scheduling in Wireless Mesh Networks
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
Christelle Molle, Fabrice Peix, Hervé Rivan...
AADEBUG
1997
Springer
13 years 11 months ago
Bisection Debugging
This paper introduces the bisection debugging model. The key idea is to use a debugger to identify the semantic differences between two versions of the same program. The debugger ...
Thomas R. Gross