Sciweavers

8540 search results - page 148 / 1708
» The Dynamic Servers Problem
Sort
View
77
Voted
JOC
2007
93views more  JOC 2007»
14 years 10 months ago
Robust Information-Theoretic Private Information Retrieval
A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain informat...
Amos Beimel, Yoav Stahl
CEC
2008
IEEE
15 years 4 months ago
Methods for decreasing the number of objective evaluations for independent computationally expensive objective problems
— In this paper, three new methods for pushing solutions toward a desired region of the objective space more quickly are explored; hypercube distance scaling, dynamic objective t...
Greg Rohling
ICDE
2007
IEEE
108views Database» more  ICDE 2007»
15 years 2 months ago
Problem definition for effective workload management
The paper introduces the problem of designing dynamic workload management (WM) tools that are aware of the diversity of classes of users and their diverse access patterns. Our app...
Adrian M. Teisanu, Sam Lightstone, Mariano P. Cons...
APPML
2004
102views more  APPML 2004»
14 years 10 months ago
Twin n-point boundary value problems
Abstract. We establish the existence of positive solutions to twin time-scale problems given by the dynamic equation -u (t) = a(t)f(u(t)), t (t1, tn) T with boundary conditions u...
D. R. Anderson
CEC
2005
IEEE
15 years 3 days ago
Equilibrium selection by co-evolution for bargaining problems under incomplete information about time preferences
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...
Nanlin Jin