Sciweavers

517 search results - page 44 / 104
» Approximation Algorithms for Scheduling with Reservations
Sort
View
WAOA
2004
Springer
132views Algorithms» more  WAOA 2004»
15 years 3 months ago
Stochastic Online Scheduling on Parallel Machines
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
Nicole Megow, Marc Uetz, Tjark Vredeveld
AUTOMATICA
2004
85views more  AUTOMATICA 2004»
14 years 9 months ago
Non-regular feedback linearization of nonlinear systems via a normal form algorithm
In this paper, the problem of non-regular static state feedback linearization of a ne nonlinear systems is considered. First of all, a new canonical form for non-regular feedback ...
Daizhan Cheng, Xiaoming Hu, Yuzhen Wang
IPL
2007
114views more  IPL 2007»
14 years 10 months ago
Spanning trees with minimum weighted degrees
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...
IS
2008
14 years 10 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
APPML
2007
92views more  APPML 2007»
14 years 10 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...