Sciweavers

14165 search results - page 627 / 2833
» The generalized two-server problem
Sort
View
SIGUCCS
2003
ACM
16 years 13 days ago
Being Sam Malone: customer service on a campus where "Everybody Knows Your Name"
Working on a small campus has many advantages: Familiarity with the majority of faculty and staff, in-depth knowledge of how systems interact, adding the personal touch to each in...
Mark Watts
SMA
2003
ACM
16 years 13 days ago
Geometric constraint solving via C-tree decomposition
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
Xiao-Shan Gao, Gui-Fang Zhang
STACS
1999
Springer
15 years 11 months ago
On Quantum Algorithms for Noncommutative Hidden Subgroups
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
Mark Ettinger, Peter Høyer
PPSN
2000
Springer
15 years 10 months ago
Optimization as Side-Effect of Evolving Allelopathic Diversity
Many bacteria carry gene complexes that code for a toxin-antidote pair, e.g. colicin systems. Such gene complexes can be advantageous for its host by killing competitor bacteria wh...
Ludo Pagie, Paulien Hogeweg
AAAI
2008
15 years 9 months ago
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu