Sciweavers

2767 search results - page 42 / 554
» Universal Exponentiation Algorithm
Sort
View
CEC
2011
IEEE
14 years 2 months ago
On universal search strategies for multi-criteria optimization using weighted sums
—We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium o...
Julien Legriel, Scott Cotton, Oded Maler
116
Voted
CORR
2008
Springer
127views Education» more  CORR 2008»
15 years 1 months ago
Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks
The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes f...
Adnan Vora, Mikhail Nesterenko, Sébastien T...
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
15 years 1 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
AICOM
2006
124views more  AICOM 2006»
15 years 2 months ago
A Compact Representation for Least Common Subsumers in the description logic ALE
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
ALGORITHMICA
2008
88views more  ALGORITHMICA 2008»
15 years 2 months ago
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
Andreas Björklund, Thore Husfeldt