Sciweavers

13214 search results - page 2615 / 2643
» Pseudorandomness for network algorithms
Sort
View
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 11 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
EDBT
2010
ACM
145views Database» more  EDBT 2010»
13 years 10 months ago
Splash: ad-hoc querying of data and statistical models
Data mining is increasingly performed by people who are not computer scientists or professional programmers. It is often done as an iterative process involving multiple ad-hoc tas...
Lujun Fang, Kristen LeFevre
LISA
2007
13 years 10 months ago
Inferring Higher Level Policies from Firewall Rules
Packet filtering firewall is one of the most important mechanisms used by corporations to enforce their security policy. Recent years have seen a lot of research in the area of ...
Alok Tongaonkar, Niranjan Inamdar, R. Sekar
ASPDAC
2008
ACM
127views Hardware» more  ASPDAC 2008»
13 years 9 months ago
Power grid analysis benchmarks
ACT Benchmarks are an immensely useful tool in performing research since they allow for rapid and clear comparison between different approaches to solving CAD problems. Recent expe...
Sani R. Nassif
ATAL
2008
Springer
13 years 9 months ago
An adaptive probabilistic trust model and its evaluation
In open settings, the participants are autonomous and there is no central authority to ensure the felicity of their interactions. When agents interact in such settings, each relie...
Chung-Wei Hang, Yonghong Wang, Munindar P. Singh
« Prev « First page 2615 / 2643 Last » Next »