Sciweavers

14158 search results - page 242 / 2832
» Generalized switch-setting problems
Sort
View
DAGSTUHL
2004
15 years 5 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter
130
Voted
SODA
2003
ACM
100views Algorithms» more  SODA 2003»
15 years 5 months ago
Quantum algorithms for some hidden shift problems
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
Wim van Dam, Sean Hallgren, Lawrence Ip
AAAI
1996
15 years 5 months ago
Nearly Monotonic Problems: A Key to Effective FA/C Distributed Sensor Interpretation?
The fesractioncslly-Qcczdrrcate, cooperative (FA/C) distributed problem-solving paradigm is one approach for organizing distributed problem solving among homogeneous, cooperating ...
Norman Carver, Victor R. Lesser, Robert Whitehair
CORR
2010
Springer
85views Education» more  CORR 2010»
15 years 4 months ago
A control-theoretical methodology for the scheduling problem
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
Carlo A. Furia, Alberto Leva, Martina Maggio, Paol...
122
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 4 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...