Sciweavers

1722 search results - page 261 / 345
» Variables in Concept Graphs
Sort
View
114
Voted
SAT
2007
Springer
181views Hardware» more  SAT 2007»
15 years 10 months ago
Breaking Symmetries in SAT Matrix Models
Abstract. Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is ex...
Inês Lynce, João P. Marques Silva
146
Voted
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 10 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
15 years 10 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...
ICSM
2005
IEEE
15 years 9 months ago
Static Analysis of Object References in RMI-Based Java Software
Distributed applications provide numerous advantages related to software performance, reliability, interoperability, and extensibility. This paper focuses on distributed Java prog...
Mariana Sharp, Atanas Rountev
SAC
2005
ACM
15 years 9 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová