Sciweavers

5214 search results - page 15 / 1043
» The Online Specialization Problem
Sort
View
EOR
2000
70views more  EOR 2000»
13 years 7 months ago
Allocation of tasks to specialized processors: A planning approach
This paper addresses the problem of scheduling randomly arriving tasks of dierent types at a diversi
K. J. Becker, Donald P. Gaver, Kevin D. Glazebrook...
VMCAI
2007
Springer
14 years 1 months ago
Constructing Specialized Shape Analyses for Uniform Change
Abstract. This paper is concerned with one of the basic problems in abstract interpretation, namely, for a given abstraction and a given set of concrete transformers (that express ...
Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W....
IJAMC
2007
114views more  IJAMC 2007»
13 years 7 months ago
Integration of rules and policies for Semantic Web Services
: Multimedia service providers on the web need their services to be well protected and easily accessible worldwide. This has initiated several lines of research to provide semantic...
Nima Kaviani, Dragan Gasevic, Marek Hatala, David ...
SIAMJO
2000
74views more  SIAMJO 2000»
13 years 7 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro
SIAMJO
2008
175views more  SIAMJO 2008»
13 years 7 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin