Sciweavers

8512 search results - page 1688 / 1703
» Computing Theory With Relevance
Sort
View
SIGMETRICS
2008
ACM
116views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Optimal sampling in state space models with applications to network monitoring
Advances in networking technology have enabled network engineers to use sampled data from routers to estimate network flow volumes and track them over time. However, low sampling ...
Harsh Singhal, George Michailidis
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 7 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
AAMAS
2005
Springer
13 years 7 months ago
Cooperative Multi-Agent Learning: The State of the Art
Cooperative multi-agent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility. Due to the interactions among t...
Liviu Panait, Sean Luke
IOR
2007
89views more  IOR 2007»
13 years 7 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
IPL
2007
99views more  IPL 2007»
13 years 7 months ago
Substitutions into propositional tautologies
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
Jan Krajícek
« Prev « First page 1688 / 1703 Last » Next »