Sciweavers

945 search results - page 17 / 189
» Incremental Branching Programs
Sort
View
COR
2006
108views more  COR 2006»
13 years 7 months ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
MICRO
1998
IEEE
144views Hardware» more  MICRO 1998»
13 years 12 months ago
Analyzing the Working Set Characteristics of Branch Execution
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
Sangwook P. Kim, Gary S. Tyson
ASPLOS
1991
ACM
13 years 11 months ago
Process Coordination with Fetch-and-Increment
Eric Freudenthal, Allan Gottlieb
ISPASS
2006
IEEE
14 years 1 months ago
Characterizing the branch misprediction penalty
Despite years of study, branch mispredictions remain as a significant performance impediment in pipelined superscalar processors. In general, the branch misprediction penalty can...
Stijn Eyerman, James E. Smith, Lieven Eeckhout
PEPM
2000
ACM
13 years 11 months ago
From Recursion to Iteration: What are the Optimizations?
Transforming recursion into iteration eliminates the use of stack frames during program execution. It has been studied extensively. This paper describes a powerful and systematic ...
Yanhong A. Liu, Scott D. Stoller