Sciweavers

2192 search results - page 358 / 439
» Algorithms for Challenging Motif Problems
Sort
View
PASTE
2004
ACM
14 years 1 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
WASA
2009
Springer
103views Algorithms» more  WASA 2009»
14 years 21 days ago
Void Avoidance in Three-Dimensional Mobile Underwater Sensor Networks
Mobile underwater sensor networks are usually featured with three-dimensional topology, high node mobility and long propagation delays. For such networks, geographic routing has be...
Peng Xie, Zhong Zhou, Zheng Peng, Jun-Hong Cui, Zh...
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
ATAL
2008
Springer
13 years 10 months ago
Aligning social welfare and agent preferences to alleviate traffic congestion
Multiagent coordination algorithms provide unique insights into the challenging problem of alleviating traffic congestion. What is particularly interesting in this class of proble...
Kagan Tumer, Zachary T. Welch, Adrian K. Agogino
ATAL
2010
Springer
13 years 9 months ago
Evolving policy geometry for scalable multiagent learning
A major challenge for traditional approaches to multiagent learning is to train teams that easily scale to include additional agents. The problem is that such approaches typically...
David B. D'Ambrosio, Joel Lehman, Sebastian Risi, ...