Sciweavers

265 search results - page 38 / 53
» ets 2000
Sort
View
EUROCRYPT
2000
Springer
14 years 1 months ago
Computing Inverses over a Shared Secret Modulus
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
Dario Catalano, Rosario Gennaro, Shai Halevi
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
14 years 1 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
KR
2000
Springer
14 years 1 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
LCPC
2000
Springer
14 years 1 months ago
Improving Offset Assignment for Embedded Processors
Embedded systems consisting of the application program ROM, RAM, the embedded processor core, and any custom hardware on a single wafer are becoming increasingly common in applicat...
Sunil Atri, J. Ramanujam, Mahmut T. Kandemir
LPAR
2000
Springer
14 years 1 months ago
Efficient Structural Information Analysis for Real CLP Languages
We present the rational construction of a generic domain for structural information analysis of real CLP languages called Pattern(D ), where the parameter D is an abstract domain s...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella