Sciweavers

516 search results - page 40 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
MP
2007
145views more  MP 2007»
13 years 9 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
JSCIC
2008
98views more  JSCIC 2008»
13 years 10 months ago
A Posteriori Error Estimates for Parabolic Variational Inequalities
We study a posteriori error estimates in the energy norm for some parabolic obstacle problems discretized with a Euler implicit time scheme combined with a finite element spatial ...
Yves Achdou, Frédéric Hecht, David P...
COMPGEOM
2010
ACM
14 years 3 months ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg
CAINE
2001
13 years 11 months ago
Model Reduction Scheme of State-Affine Systems
In this paper, a new method for the approximation of discrete time state-affine systems is proposed. The method is based on the diagonalization of proposed generalized controllabi...
Samir A. Al-Baiyat
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 9 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch