Sciweavers

10055 search results - page 91 / 2011
» Structured programming using processes
Sort
View
JMLR
2010
149views more  JMLR 2010»
13 years 2 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
CP
2003
Springer
14 years 1 months ago
Propagating N-Ary Rigid-Body Constraints
In this paper, we present an algorithm to propagate an n-ary constraint (with n greater than 2) specifying the relative positions of points in a three-dimensional rigid group. The ...
Ludwig Krippahl, Pedro Barahona
SCP
2010
96views more  SCP 2010»
13 years 6 months ago
Enforcing structural regularities in software using IntensiVE
The design and implementation of a software system is often governed by a variety of coding conventions, design patterns, architectural guidelines, design rules, and other so-call...
Johan Brichau, Andy Kellens, Sergio Castro, Theo D...
CPP
2011
98views more  CPP 2011»
12 years 7 months ago
Automatically Verifying Typing Constraints for a Data Processing Language
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
Michael Backes, Catalin Hritcu, Thorsten Tarrach
SBACPAD
2003
IEEE
102views Hardware» more  SBACPAD 2003»
14 years 1 months ago
Performance Analysis of DECK Collective Communication Service
Collective communication is very useful for parallel applications, especially those in which matrix and vector data structures need to be manipulated by a group of processes. This...
Rafael Ennes Silva, Delcino Picinin, Marcos E. Bar...