Sciweavers

500 search results - page 56 / 100
» Improving Search in Peer-to-Peer Networks
Sort
View
WSC
2007
15 years 2 months ago
Allocation of simulation runs for simulation optimization
Simulation optimization (SO) is the process of finding the optimum design of a system whose performance measure(s) are estimated via simulation. We propose some ideas to improve o...
Alireza Kabirian, Sigurdur Ólafsson
CIIT
2007
133views Communications» more  CIIT 2007»
15 years 1 months ago
Linear-tree rule structure for firewall optimization
Given a list of filtering rules with individual hitting probabilities, it is known that the average processing time of a linear-search based firewall can be minimized by searchi...
Liang Zhao, A. Shimae, Hiroshi Nagamochi
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
15 years 6 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
AAAI
2006
15 years 1 months ago
An Edge Deletion Semantics for Belief Propagation and its Practical Impact on Approximation Quality
We show in this paper that the influential algorithm of iterative belief propagation can be understood in terms of exact inference on a polytree, which results from deleting enoug...
Arthur Choi, Adnan Darwiche
ATAL
2009
Springer
15 years 6 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...