Sciweavers

774 search results - page 55 / 155
» Process Discovery Using Integer Linear Programming
Sort
View
VEE
2005
ACM
143views Virtualization» more  VEE 2005»
14 years 3 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
CCS
2007
ACM
14 years 4 months ago
Improving vulnerability discovery models
Security researchers are applying software reliability models to vulnerability data, in an attempt to model the vulnerability discovery process. I show that most current work on t...
Andy Ozment
VLSID
1994
IEEE
124views VLSI» more  VLSID 1994»
14 years 2 months ago
ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
Samit Chaudhuri, Robert A. Walker
IPCO
2001
79views Optimization» more  IPCO 2001»
13 years 11 months ago
Synthesis of 2-Commodity Flow Networks
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
Refael Hassin, Asaf Levin
EOR
2010
219views more  EOR 2010»
13 years 10 months ago
The Attractive Traveling Salesman Problem
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
Günes Erdogan, Jean-François Cordeau, ...