650 search results - page 84 / 130 » Progressive simplicial complexes |
TPHOL
2005
IEEE
14 years 4 months ago
2005
IEEE
Abstract. How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machinechecked proofs? We propose an initial set of b...
GRAPHITE
2005
ACM
14 years 4 months ago
2005
ACM
The computational requirements of full global illumination rendering are such that it is still not possible to achieve high-fidelity graphics of very complex scenes in a reasonab...
CALCO
2005
Springer
14 years 4 months ago
2005
Springer
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
GECCO
2005
Springer
14 years 4 months ago
2005
Springer
In reinforcement learning problems it has been considered that neither exploitation nor exploration can be pursued exclusively without failing at the task. The optimal balance bet...
GECCO
2005
Springer
14 years 4 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...