Sciweavers

14158 search results - page 220 / 2832
» Generalized switch-setting problems
Sort
View
136
Voted
VL
1994
IEEE
121views Visual Languages» more  VL 1994»
15 years 7 months ago
Using 3D Tubes to Solve the Intersecting Line Representation Problem
In this paper we discuss 3D rendering as a solution to the line crossing problem associated with using connecting lines for illustrating relations in visual programming. The Bezie...
Lindsey L. Spratt, Allen L. Ambler
96
Voted
STOC
1987
ACM
104views Algorithms» more  STOC 1987»
15 years 7 months ago
The Boolean Formula Value Problem Is in ALOGTIME
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
Samuel R. Buss
134
Voted
PDPTA
1996
15 years 5 months ago
Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
Darrell R. Ulm, Johnnie W. Baker
127
Voted
JSW
2006
76views more  JSW 2006»
15 years 3 months ago
Variable Neighbourhood Search for Job Shop Scheduling Problems
Variable Neighbourhood Search (VNS) is one of the most recent metaheuristics used for problem solving in which a systematic change of neighbourhood within a local search is carried...
Mehmet Sevkli, Mehmet Emin Aydin
102
Voted
MP
2006
121views more  MP 2006»
15 years 3 months ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg