Sciweavers

322 search results - page 50 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
VECPAR
2004
Springer
14 years 2 months ago
Message Strip-Mining Heuristics for High Speed Networks
In this work we investigate how the compiler technique of message strip mining performs in practice on contemporary high performance networks. Message strip mining attempts to redu...
Costin Iancu, Parry Husbands, Wei Chen
COOPIS
2003
IEEE
14 years 2 months ago
Extending OO Metamodels towards Dynamic Object Roles
This paper discusses some of the implications of introducing the dynamic object role concept into object-oriented metamodels on both implementational and conceptual modeling levels...
Andrzej Jodlowski, Piotr Habela, Jacek Plodzien, K...
LPAR
2004
Springer
14 years 2 months ago
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 3 months ago
On the Benefit of Virtualization: Strategies for Flexible Server Allocation
Abstract--Virtualization technology facilitates a dynamic, demanddriven allocation and migration of servers. This paper studies how the flexibility offered by network virtualizatio...
Dushyant Arora, Anja Feldmann, Gregor Schaffrath, ...
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 3 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...