Sciweavers

2485 search results - page 265 / 497
» Time Bounded Frequency Computations
Sort
View
NIPS
2003
13 years 9 months ago
Nonlinear Filtering of Electron Micrographs by Means of Support Vector Regression
Nonlinear filtering can solve very complex problems, but typically involve very time consuming calculations. Here we show that for filters that are constructed as a RBF network ...
Roland Vollgraf, Michael Scholz, Ian A. Meinertzha...
AIPS
2004
13 years 9 months ago
Iterative Relaxations for Iterative Flattening in Cumulative Scheduling
Cumulative scheduling is a generalization of jobshop scheduling, where machines have discrete capacities and activities may require several capacity units. This paper considers it...
Laurent Michel, Pascal Van Hentenryck
JPDC
2008
122views more  JPDC 2008»
13 years 8 months ago
Stochastic robustness metric and its use for static resource allocations
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
Vladimir Shestak, Jay Smith, Anthony A. Maciejewsk...
CPAIOR
2010
Springer
14 years 1 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...
CP
2007
Springer
14 years 6 days ago
On Inconsistent Clause-Subsets for Max-SAT Solving
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...