Sciweavers

963 search results - page 9 / 193
» On Computation of Performance Bounds of Optimal Index Assign...
Sort
View
WINE
2009
Springer
93views Economy» more  WINE 2009»
16 years 11 days ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
204
Voted
EDBT
1998
ACM
155views Database» more  EDBT 1998»
15 years 10 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
ECRTS
2006
IEEE
15 years 12 months ago
Optimal deadline assignment for periodic real-time tasks in dynamic priority systems
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified i...
Patricia Balbastre, Ismael Ripoll, Alfons Crespo
MP
2010
132views more  MP 2010»
15 years 17 days ago
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the b...
Etienne de Klerk, Renata Sotirov
ICALP
2004
Springer
15 years 11 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella