Sciweavers

3415 search results - page 584 / 683
» Lower Bounds for Kernelizations
Sort
View
TIT
2008
119views more  TIT 2008»
13 years 10 months ago
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
Prasanna Chaporkar, Koushik Kar, Xiang Luo, Saswat...
JAIR
2007
111views more  JAIR 2007»
13 years 10 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson
JAT
2007
83views more  JAT 2007»
13 years 10 months ago
Characterization and perturbation of Gabor frame sequences with rational parameters
Let A ⊂ L2(R) be at most countable, and p, q ∈ N. We characterize various frame-properties for Gabor systems of the form G(1, p/q,A) = {e2 imxg(x − np/q) : m, n ∈ Z, g ∈...
Marcin Bownik, Ole Christensen
JCO
2007
123views more  JCO 2007»
13 years 10 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
JCP
2007
102views more  JCP 2007»
13 years 10 months ago
Deterministic Models of an Active Magnetic Bearing System
— In this paper the development of mathematical model of voltage-input and current-input active magnetic bearing (AMB) system in deterministic form is presented. The AMB system, ...
Abdul Rashid Husain, Mohamad Noh Ahmad, Abdul Hali...