Sciweavers

4313 search results - page 387 / 863
» Using time travel to diagnose computer problems
Sort
View
CEC
2009
IEEE
16 years 2 months ago
GPU-based parallel particle swarm optimization
— A novel parallel approach to run standard particle swarm optimization (SPSO) on Graphic Processing Unit (GPU) is presented in this paper. By using the general-purpose computing...
You Zhou, Ying Tan
DAC
1997
ACM
15 years 11 months ago
Remembrance of Things Past: Locality and Memory in BDDs
Binary Decision Diagrams BDDs are e cient at manipulating large sets in a compact manner. BDDs, however, are inefcient at utilizing the memory hierarchy of the computer. Recent ...
Srilatha Manne, Dirk Grunwald, Fabio Somenzi
IPPS
2000
IEEE
16 years 3 hour ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke
FC
2009
Springer
118views Cryptology» more  FC 2009»
16 years 2 months ago
Cryptographic Combinatorial Clock-Proxy Auctions
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
David C. Parkes, Michael O. Rabin, Christopher Tho...
PODS
2001
ACM
135views Database» more  PODS 2001»
16 years 7 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...