Sciweavers

2523 search results - page 286 / 505
» Objective: In Minimum Context
Sort
View
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
15 years 6 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
EOR
2008
110views more  EOR 2008»
15 years 6 months ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
HEURISTICS
2008
92views more  HEURISTICS 2008»
15 years 6 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
IIE
2008
149views more  IIE 2008»
15 years 6 months ago
Information Technologies for Biology Education: Computerized Electrophysiology of Plant Cells
Abstract. Biology has moved from a bench-based discipline to a bioinformational science in modern times but application of computational and analytical methods of informatics in it...
Vilma Kisnieriene, Kastytis Beitas, Vidmantas Saka...
IJAIT
2008
99views more  IJAIT 2008»
15 years 6 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek