Sciweavers

1844 search results - page 317 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
VLDB
2004
ACM
100views Database» more  VLDB 2004»
15 years 4 months ago
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molin...
AAAI
2006
15 years 19 days ago
Embedding Heterogeneous Data Using Statistical Models
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
Amir Globerson, Gal Chechik, Fernando Pereira, Naf...
TC
1998
14 years 11 months ago
Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks
—We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars (POPS) topology. We show that, often, the obvio...
Greg Gravenstreter, Rami G. Melhem
IROS
2009
IEEE
125views Robotics» more  IROS 2009»
15 years 5 months ago
A tale of two planners: Modular robotic planning with LDP
Abstract— LDP (Locally Distributed Predicates) is a distributed, high-level language for programming modular reconfigurable robot systems (MRRs). In this paper we present the im...
Michael DeRosa, Seth Copen Goldstein, Peter Lee, P...
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
14 years 9 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...