Sciweavers

1569 search results - page 41 / 314
» Programming contest strategy
Sort
View
IAT
2008
IEEE
13 years 10 months ago
A Game-Theoretic Approach to Determining Efficient Patrolling Strategies for Mobile Robots
Use of game-theoretic models to address patrolling applications has gained increasing interest in the very last years. The patrolling agent is considered playing a game against an...
Francesco Amigoni, Nicola Gatti, Antonio Ippedico
ISCI
2007
88views more  ISCI 2007»
13 years 9 months ago
Strategy creation, decomposition and distribution in particle navigation
Strategy planning is crucial to control a group to achieve a number of tasks in a closed area full of obstacles. In this study, genetic programming has been used to evolve rule-ba...
Ulas Beldek, Kemal Leblebicioglu
IV
2010
IEEE
186views Visualization» more  IV 2010»
13 years 7 months ago
Visual Amortization Analysis of Recompilation Strategies
Abstract--Dynamic recompilation tries to produce more efficient code by exploiting runtime information. Virtual machines like the Jikes RVM use recompilation heuristics to decide h...
Stephan Zimmer, Stephan Diehl
COMPSAC
2003
IEEE
14 years 3 months ago
A Strategy for Selecting Synchronization Sequences to Test Concurrent Object-Oriented Software
Testing is the most commonly used approach to the assurance of software quality and reliability. The testing of object-oriented software is much more complex than that of conventi...
Huo Yan Chen, Yu Xia Sun, T. H. Tse
FLOPS
1999
Springer
14 years 2 months ago
Typed Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
Sergio Antoy, Andrew P. Tolmach