Sciweavers

169 search results - page 26 / 34
» A weakly stable algorithm for general Toeplitz systems
Sort
View
AGENTS
2001
Springer
15 years 2 months ago
It knows what you're going to do: adding anticipation to a Quakebot
The complexity of AI characters in computer games is continually improving; however they still fall short of human players. In this paper we describe an AI bot for the game Quake ...
John E. Laird
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
15 years 2 months ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
92
Voted
DLS
2008
149views Languages» more  DLS 2008»
14 years 11 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
88
Voted
ATAL
2003
Springer
15 years 2 months ago
Designing Self-Assembly for 2-Dimensional Building Blocks
In this paper we present a genetic algorithm-based approach towards designing self-assembling objects comprised of square smart blocks. Each edge of each block can have one of thr...
Ying Guo, Geoff Poulton, Philip Valencia, Geoff Ja...
JSC
2007
79views more  JSC 2007»
14 years 9 months ago
Computation of bases of free modules over the Weyl algebras
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
Alban Quadrat, Daniel Robertz