Sciweavers

388 search results - page 47 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
14 years 10 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
ATAL
2010
Springer
15 years 28 days ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
EOR
2007
101views more  EOR 2007»
14 years 11 months ago
Searching for multiobjective preventive maintenance schedules: Combining preferences with evolutionary algorithms
Heavy industry maintenance facilities at aircraft service centers or railroad yards must contend with scheduling preventive maintenance tasks to ensure critical equipment remains ...
Gang Quan, Garrison W. Greenwood, Donglin Liu, Xia...
ICA
2010
Springer
14 years 12 months ago
Adaptive Segmentation and Separation of Determined Convolutive Mixtures under Dynamic Conditions
Abstract. In this paper, we propose a method for blind source separation (BSS) of convolutive audio recordings with short blocks of stationary sources, i.e. dynamically changing so...
Benedikt Loesch, Bin Yang
ICML
2008
IEEE
16 years 18 days ago
ICA and ISA using Schweizer-Wolff measure of dependence
We propose a new algorithm for independent component and independent subspace analysis problems. This algorithm uses a contrast based on the Schweizer-Wolff measure of pairwise de...
Barnabás Póczos, Sergey Kirshner