Sciweavers

176 search results - page 11 / 36
» heuristics 1998
Sort
View
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
AAAI
1998
13 years 9 months ago
Finding Optimal Strategies for Imperfect Information Games
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
Ian Frank, David A. Basin, Hitoshi Matsubara
LCTRTS
1998
Springer
13 years 11 months ago
A Design Environment for Counterflow Pipeline Synthesis
The Counterflow Pipeline (CFP) organization may be a good target for synthesis of application-specific microprocessors for embedded systems because it has a regular and simple str...
Bruce R. Childers, Jack W. Davidson
IPPS
1998
IEEE
13 years 11 months ago
Predicated Software Pipelining Technique for Loops with Conditions
An effort to formalize the process of software pipelining loops with conditions is presented in this paper. A formal framework for scheduling such loops, based on representing set...
Dragan Milicev, Zoran Jovanovic
IPPS
1998
IEEE
13 years 11 months ago
Register-Sensitive Software Pipelining
In this paper, we propose an integrated approach for register-sensitive software pipelining. In this approach, the heuristics proposed in the stage scheduling method of Eichenberg...
Amod K. Dani, V. Janaki Ramanan, Ramaswamy Govinda...