Sciweavers

4372 search results - page 524 / 875
» Algorithmic Theories of Everything
Sort
View
215
Voted
EMSOFT
2005
Springer
16 years 1 months ago
A structural approach to quasi-static schedulability analysis of communicating concurrent programs
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
16 years 1 months ago
Online Occlusion Culling
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...
Gereon Frahling, Jens Krokowski
GECCO
2005
Springer
111views Optimization» more  GECCO 2005»
16 years 1 months ago
XCS with eligibility traces
The development of the XCS Learning Classifier System has produced a robust and stable implementation that performs competitively in direct-reward environments. Although investig...
Jan Drugowitsch, Alwyn Barry
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
16 years 1 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
177
Voted
COMPGEOM
2004
ACM
16 years 1 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...