Sciweavers

945 search results - page 103 / 189
» Incremental Branching Programs
Sort
View
ML
1998
ACM
117views Machine Learning» more  ML 1998»
13 years 8 months ago
Learning Team Strategies: Soccer Case Studies
We use simulated soccer to study multiagent learning. Each team's players (agents) share action set and policy, but may behave di erently due to position-dependent inputs. All...
Rafal Salustowicz, Marco Wiering, Jürgen Schm...
DAC
2003
ACM
14 years 10 months ago
Accurate timing analysis by modeling caches, speculation and their interaction
Schedulability analysis of real-time embedded systems requires worst case timing guarantees of embedded software performance. This involves not only language level program analysi...
Xianfeng Li, Tulika Mitra, Abhik Roychoudhury
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
14 years 2 months ago
Evolution of multi-loop controllers for fixed morphology with a cyclic genetic algorithm
Cyclic genetic algorithms can be used to generate single loop control programs for robots. While successful in generating controllers for individual leg movement, gait generation,...
Gary B. Parker, Ramona Georgescu
EICS
2010
ACM
14 years 2 months ago
Using ensembles of decision trees to automate repetitive tasks in web applications
Web applications such as web-based email, spreadsheets and form filling applications have become ubiquitous. However, many of the tasks that users try to accomplish with such web ...
Zachary Bray, Per Ola Kristensson
PLDI
1996
ACM
14 years 1 months ago
Fast, Effective Dynamic Compilation
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...
Joel Auslander, Matthai Philipose, Craig Chambers,...