355 search results - page 45 / 71 » A New Approximation Technique for Resource-Allocation Proble... |
ICCAD
2003
IEEE
15 years 8 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
104
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
Particle filtering provides a general framework for propagating probability density functions in non-linear and non-Gaussian systems. However, the algorithm is based on a Monte Ca...
104
click to vote
CP
2009
Springer
15 years 6 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
SIAMSC
2008
14 years 11 months ago
2008
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...
128
click to vote
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...