Sciweavers

4047 search results - page 573 / 810
» The Discrete Basis Problem
Sort
View
MOBICOM
2003
ACM
15 years 10 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
133
Voted
GECCO
2003
Springer
123views Optimization» more  GECCO 2003»
15 years 9 months ago
Benefits of Implicit Redundant Genetic Algorithms for Structural Damage Detection in Noisy Environments
A robust structural damage detection method that can handle noisy frequency response function information is discussed. The inherent unstructured nature of damage detection problem...
Anne M. Raich, Tamás Liszkai
199
Voted
EUROCRYPT
1999
Springer
15 years 9 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier
EWCBR
1998
Springer
15 years 8 months ago
On Bayesian Case Matching
Abstract. Case retrieval is an important problem in several commercially signi cant application areas, such as industrial con guration and manufacturing problems. In this paper we ...
Petri Kontkanen, Petri Myllymäki, Tomi Siland...
149
Voted
WSC
2000
15 years 6 months ago
Using simulation and critical points to define states in continuous search spaces
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
Marc S. Atkin, Paul R. Cohen