Sciweavers

597 search results - page 115 / 120
» Homomorphisms of random paths
Sort
View
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
14 years 1 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
SODA
2008
ACM
109views Algorithms» more  SODA 2008»
13 years 11 months ago
Auctions for structured procurement
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
Matthew Cary, Abraham D. Flaxman, Jason D. Hartlin...
AAAI
2006
13 years 11 months ago
ScriptEase - Motivational Behaviors for Interactive Characters in Computer Role-Playing Games
ScriptEase is a tool that allows authors with no programming experience to create interactive stories for computer role-playing games. Instead of writing scripting code manually, ...
Maria Cutumisu, Duane Szafron, Jonathan Schaeffer,...
LISA
2000
13 years 11 months ago
Tracing Anonymous Packets to Their Approximate Source
Most denial-of-service attacks are characterized by a flood of packets with random, apparently valid source addresses. These addresses are spoofed, created by a malicious program ...
Hal Burch, Bill Cheswick
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 11 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...