Sciweavers

356 search results - page 47 / 72
» Optimization of Machine Descriptions for Efficient Use
Sort
View
CCS
2010
ACM
13 years 8 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
14 years 1 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
13 years 11 months ago
Robot gaits evolved by combining genetic algorithms and binary hill climbing
In this paper an evolutionary algorithm is used for evolving gaits in a walking biped robot controller. The focus is fast learning in a real-time environment. An incremental appro...
Lena Mariann Garder, Mats Erling Høvin
EOR
2007
82views more  EOR 2007»
13 years 7 months ago
Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
: New semiconductor wafer fabrication facilities use Front Opening Unified Pods (FOUPs) as a common unit of wafer transfer. Since the number of pods is limited due to high costs, a...
Jeffrey D. Laub, John W. Fowler, Ahmet B. Keha
TPDS
2008
76views more  TPDS 2008»
13 years 7 months ago
How to Choose a Timing Model
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer