Sciweavers

2157 search results - page 309 / 432
» Binary ant algorithm
Sort
View
141
Voted
KBS
2006
127views more  KBS 2006»
15 years 5 months ago
Collaborative Recommending using Formal Concept Analysis
We show how Formal Concept Analysis (FCA) can be applied to Collaborative Recommenders. FCA is a mathematical method for analysing binary relations. Here we apply it to the relati...
Patrick du Boucher-Ryan, Derek G. Bridge
MST
2006
120views more  MST 2006»
15 years 4 months ago
Exploiting Regularities for Boolean Function Synthesis
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...
133
Voted
JGTOOLS
2007
144views more  JGTOOLS 2007»
15 years 4 months ago
Faster Relief Mapping using the Secant Method
Relief mapping using the secant method offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique...
Eric Risser, Musawir Shah, Sumanta N. Pattanaik
ALGORITHMICA
2000
65views more  ALGORITHMICA 2000»
15 years 4 months ago
A Simultaneous Search Problem
We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x, y [0, 1] with as little uncertain...
Ee-Chien Chang, Chee-Keng Yap
144
Voted
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
15 years 4 months ago
On the Excluded Minors for Matroids of Branch-Width Three
Knowing the excluded minors for a minor-closed matroid property provides a useful alternative characterization of that property. It has been shown in [R. Hall, J. Oxley, C. Semple...
Petr Hlinený