Sciweavers

387 search results - page 38 / 78
» Many Random Walks Are Faster Than One
Sort
View
IPPS
1997
IEEE
14 years 1 months ago
Optimizing Parallel Bitonic Sort
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorti...
Mihai F. Ionescu
ICLP
2010
Springer
14 years 29 days ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
ATAL
2006
Springer
14 years 24 days ago
Modeling uncertain domains with polyagents
Agent-based modeling is a powerful tool for systems modeling. Instantiating each domain entity with an agent permits us to capture many aspects of system dynamics and interactions...
H. Van Dyke Parunak, Sven Brueckner
TSP
2008
178views more  TSP 2008»
13 years 9 months ago
Heteroscedastic Low-Rank Matrix Approximation by the Wiberg Algorithm
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
Pei Chen
CP
2010
Springer
13 years 7 months ago
Generating Special-Purpose Stateless Propagators for Arbitrary Constraints
Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation th...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...