Sciweavers

519 search results - page 51 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
CAV
2010
Springer
192views Hardware» more  CAV 2010»
15 years 5 months ago
Invariant Synthesis for Programs Manipulating Lists with Unbounded Data
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, A...
VEE
2005
ACM
143views Virtualization» more  VEE 2005»
15 years 7 months ago
Optimized interval splitting in a linear scan register allocator
We present an optimized implementation of the linear scan register allocation algorithm for Sun Microsystems’ Java HotSpotTM client compiler. Linear scan register allocation is ...
Christian Wimmer, Hanspeter Mössenböck
COLOGNETWENTE
2009
15 years 2 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...
STACS
2010
Springer
15 years 8 months ago
Dispersion in Unit Disks
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
Adrian Dumitrescu, Minghui Jiang
CISST
2003
83views Hardware» more  CISST 2003»
15 years 2 months ago
Computational Efficiency of Structural Image Matching
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
Richard Chase, Boris Kovalerchuk