Sciweavers

7978 search results - page 484 / 1596
» Combining shared-coin algorithms
Sort
View
COMBINATORICS
2002
102views more  COMBINATORICS 2002»
15 years 6 months ago
Computation in Coxeter Groups-I. Multiplication
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...
Bill Casselman
EOR
2002
67views more  EOR 2002»
15 years 6 months ago
Solving the multiple competitive facilities location problem
In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in ...
Tammy Drezner, Zvi Drezner, Said Salhi
CGF
1999
144views more  CGF 1999»
15 years 6 months ago
Occluder Shadows for Fast Walkthroughs of Urban Environments
This paper describes a new algorithm that employs image-based rendering for fast occlusion culling in complex urban environments. It exploits graphics hardware to render and autom...
Peter Wonka, Dieter Schmalstieg
INTEGRATION
2010
172views more  INTEGRATION 2010»
15 years 5 months ago
Analog circuits optimization based on evolutionary computation techniques
1 — This paper presents a new design automation tool based on a modified genetic algorithm kernel, in order to increase efficiency on the analog circuit and system design cycle. ...
Manuel F. M. Barros, Jorge Guilherme, Nuno Horta
DOCENG
2009
ACM
16 years 1 months ago
Deriving image-text document surrogates to optimize cognition
The representation of information collections needs to be optimized for human cognition. While documents often include rich visual components, collections, including personal coll...
Eunyee Koh, Andruid Kerne