Sciweavers

1581 search results - page 100 / 317
» Domain semantics of possibility computations
Sort
View
155
Voted
VLUDS
2010
212views Visualization» more  VLUDS 2010»
14 years 7 months ago
Open Problems in Computational Steering of Massive Parallel Unstructured Grid Based CFD Simulations
Traditionally, analysis of flow fields resulting from computational fluid dynamics (CFD) calculations is a sequential process. The flow area defined by surrounding geometry is tes...
Christian Wagner
122
Voted
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 7 months ago
XCSF with computed continuous action
Wilson introduced XCSF as a successor to XCS. The major development of XCSF is the concept of a computed prediction. The efficiency of XCSF in dealing with numerical input and con...
Trung Hau Tran, Cédric Sanza, Yves Duthen, ...
97
Voted
IWEC
2004
15 years 2 months ago
How Realistic is Realism? Considerations on the Aesthetics of Computer Games
One of the major goals in the development of virtual environments in recent years has been to create more and more realistic scenery, characters and natural human forms of interact...
Richard Wages, Stefan Grünvogel, Benno Gr&uum...
107
Voted
TC
2008
15 years 22 days ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
102
Voted
CG
2006
Springer
15 years 4 months ago
Monte-Carlo Proof-Number Search for Computer Go
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...
Jahn-Takeshi Saito, Guillaume Chaslot, Jos W. H. M...