Sciweavers

413 search results - page 39 / 83
» Lattice Boltzmann Method
Sort
View
GECCO
2004
Springer
15 years 5 months ago
Modeling Selection Intensity for Toroidal Cellular Evolutionary Algorithms
We present quantitative models for the selection pressure of cellular evolutionary algorithms structured in two dimensional regular lattices. We derive models based on probabilisti...
Mario Giacobini, Enrique Alba, Andrea Tettamanzi, ...
ITS
2004
Springer
137views Multimedia» more  ITS 2004»
15 years 5 months ago
Integrating Intelligent Agents, User Models, and Automatic Content Categorization in a Virtual Environment
This work is devoted to lattice-based information representation of correlations among delivery criteria in transport logistics. The number of delivery criteria, their ranking acc...
Cássia Trojahn dos Santos, Fernando Santos ...
RIA
2008
73views more  RIA 2008»
14 years 11 months ago
Representing and Manipulating Situation Hierarchies using Situation Lattices
Situations, the semantic interpretations of context, provide a better basis for selecting adaptive behaviours than context itself. The definition of situations typically rests on t...
Juan Ye, Lorcan Coyle, Simon A. Dobson, Paddy Nixo...
INDOCRYPT
2010
Springer
14 years 9 months ago
Partial Key Exposure Attack on RSA - Improvements for Limited Lattice Dimensions
Abstract. Consider the RSA public key cryptosystem with the parameters N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. In this paper, cryp...
Santanu Sarkar, Sourav Sengupta, Subhamoy Maitra
MDAI
2007
Springer
15 years 6 months ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...