10493 search results - page 382 / 2099 » Dynamic Word Problems |
186
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
168
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper presents an adaptation of a novel algorithm based on the foraging behavior of honey bees to solve constrained numerical optimization problems. The modifications focus on...
135
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...
194
click to vote
HPDC
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper describes the study conducted to design and evaluate a two-level on-line scheduler to dynamically schedule a stream of sequential and multi-threaded batch jobs on large...
157
click to vote
JSAC
2006
15 years 6 months ago
2006
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...