Sciweavers

11740 search results - page 386 / 2348
» More Problems in Rewriting
Sort
View
USITS
2003
15 years 8 months ago
Network-Sensitive Service Discovery
We consider the problem of network-sensitive service selection (NSSS): finding services that match a particular set of functional and network properties. Current solutions handle...
An-Cheng Huang, Peter Steenkiste
CHES
2010
Springer
166views Cryptology» more  CHES 2010»
15 years 7 months ago
Algebraic Side-Channel Analysis in the Presence of Errors
Measurement errors make power analysis attacks difficult to mount when only a single power trace is available: the statistical methods that make DPA attacks so successful are not a...
Yossef Oren, Mario Kirschbaum, Thomas Popp, Avisha...
ECAI
2010
Springer
15 years 7 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert
GLOBECOM
2007
IEEE
15 years 7 months ago
On Static Code Construction for Alternating Multicast and Simultaneous Multicasts
— In this paper, we introduce a network multicast problem called the alternating multicast problem. In this problem, there is more than one multicast on the network, but only one...
Chi Kin Ngai, Shenghao Yang, Raymond W. Yeung
ASC
2010
15 years 6 months ago
Simplifying Particle Swarm Optimization
The general purpose optimization method known as Particle Swarm Optimization (PSO) has received much attention in past years, with many attempts to find the variant that performs ...
M. E. H. Pedersen, Andrew J. Chipperfield