Sciweavers

902 search results - page 93 / 181
» R* Search
Sort
View
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
14 years 12 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson
AMC
2006
115views more  AMC 2006»
14 years 12 months ago
A memetic algorithm for a vehicle routing problem with backhauls
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
Reza Tavakkoli-Moghaddam, A. R. Saremi, M. S. Ziae...
ENDM
2006
91views more  ENDM 2006»
14 years 12 months ago
There are exactly five biplanes with k=11
A biplane is a 2-(k(k - 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k...
Patric R. J. Östergård, Petteri Kaski
ISI
2008
Springer
14 years 12 months ago
Improving quality and performance of schema matching in large scale
ABSTRACT. Schema matching is a crucial task to gather information of the same domain. However, this process is still largely performed manually or semi-automatically, discouraging ...
Fabien Duchateau, Zohra Bellahsene, Mathieu Roche
EAAI
2007
90views more  EAAI 2007»
14 years 12 months ago
AI techniques in modelling, assignment, problem solving and optimization
This paper recapitulates the results of a long research on a family of artificial intelligence (AI) methods—relying on, e.g., artificial neural networks and search techniques...
Zsolt János Viharos, Zsolt Kemény