Sciweavers

4066 search results - page 28 / 814
» Improved Algorithms and Analysis for Secretary Problems and ...
Sort
View
MOC
2002
108views more  MOC 2002»
13 years 7 months ago
Convergence of the multigrid $V$-cycle algorithm for second-order boundary value problems without full elliptic regularity
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction...
Susanne C. Brenner
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ECRTS
2003
IEEE
14 years 25 days ago
Using Supertasks to Improve Processor Utilization in Multiprocessor Real-Time Systems
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...
Philip Holman, James H. Anderson
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
Analysis of noisy time-series signals with GA involving viral infection with tropism
In this paper we report on a study in which genetic algorithms are applied to the analysis of noisy time-series signals, which is related to the problem of analyzing the motion ch...
Yuji Sato, Yuta Yasuda, Ryuji Goto
IPPS
1997
IEEE
13 years 11 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi