Sciweavers

1734 search results - page 135 / 347
» its 2000
Sort
View
STOC
2000
ACM
97views Algorithms» more  STOC 2000»
15 years 10 months ago
Quantum lower bounds by quantum arguments
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
Andris Ambainis
153
Voted
WOSP
2000
ACM
15 years 10 months ago
Analytic modeling of load balancing policies for tasks with heavy-tailed distributions
We present an analytic technique for modeling load balancing policies on a cluster of servers conditioned on the fact that the service times of arriving tasks are drawn from heavy...
Alma Riska, Evgenia Smirni, Gianfranco Ciardo
ADBIS
2000
Springer
97views Database» more  ADBIS 2000»
15 years 10 months ago
An Efficient Storage Manager
When dealing with large quantities of clauses, the use of persistent knowledge is inevitable, and indexing methods are essential to answer queries efficiently. We introduce PerKMan...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
ADBIS
2000
Springer
88views Database» more  ADBIS 2000»
15 years 10 months ago
Finding Generalized Path Patterns for Web Log Data Mining
Conducting data mining on logs of web servers involves the determination of frequently occurring access sequences. We examine the problem of finding traversal patterns from web lo...
Alexandros Nanopoulos, Yannis Manolopoulos
AGENTCL
2000
Springer
15 years 10 months ago
A Social Semantics for Agent Communication Languages
The ability to communicate is one of the salient properties of agents. Although a number of agent communication languages (ACLs) have been developed, obtaining a suitable formal se...
Munindar P. Singh