Sciweavers

10608 search results - page 1969 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 1 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
103
Voted
HPDC
2010
IEEE
15 years 1 months ago
Cluster-wide context switch of virtualized jobs
Clusters are mostly used through Resources Management Systems (RMS) with a static allocation of resources for a bounded amount of time. Those approaches are known to be insufficie...
Fabien Hermenier, Adrien Lebre, Jean-Marc Menaud
MM
2010
ACM
125views Multimedia» more  MM 2010»
15 years 23 days ago
Tenor: making coding practical from servers to smartphones
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...
Hassan Shojania, Baochun Li
MOBICOM
2010
ACM
15 years 23 days ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
CCS
2010
ACM
15 years 23 days ago
Modeling attacks on physical unclonable functions
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
Ulrich Rührmair, Frank Sehnke, Jan Sölte...
« Prev « First page 1969 / 2122 Last » Next »