Sciweavers

491 search results - page 56 / 99
» Linear Quantifier Elimination
Sort
View
DISOPT
2008
93views more  DISOPT 2008»
13 years 9 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 8 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger
JAMDS
2002
65views more  JAMDS 2002»
13 years 8 months ago
Optimum workforce scheduling under the (14, 21) days-off timetable
Abstract. An efficient optimum solution is presented for a real-life employee daysoff scheduling problem with a three-week cycle. Over a given work cycle, each worker is given 14 s...
Hesham K. Alfares
TC
1998
13 years 8 months ago
An Efficient Solution to the Cache Thrashing Problem Caused by True Data Sharing
—When parallel programs are executed on multiprocessors with private caches, a set of data may be repeatedly used and modified by different threads. Such data sharing can often r...
Guohua Jin, Zhiyuan Li, Fujie Chen
ROBOTICA
2008
100views more  ROBOTICA 2008»
13 years 8 months ago
A symbolic approach to polyhedral scene analysis by parametric calotte propagation
Polyhedral scene analysis studies whether a 2D line drawing of a 3D polyhedron is realizable in the space, and if so, parameterizing the space of all possible realizations. For gen...
Hongbo Li, Lina Zhao, Ying Chen