Sciweavers

738 search results - page 51 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
HPDC
2002
IEEE
15 years 2 months ago
A Scalable QoS-Aware Service Aggregation Model for Peer-to-Peer Computing Grids
Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These syste...
Xiaohui Gu, Klara Nahrstedt
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
15 years 10 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
DAC
2008
ACM
15 years 10 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
TON
2002
99views more  TON 2002»
14 years 9 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
CCE
2005
14 years 9 months ago
Computer-aided molecular design using Tabu search
A detailed implementation of the Tabu Search (TS) algorithm for computer-aided molecular design (CAMD) of transition metal catalysts is presented in this paper. Previous CAMD rese...
Bao Lin, Sunitha Chavali, Kyle V. Camarda, David C...