Sciweavers

330 search results - page 42 / 66
» Algorithms for Propositional Model Counting
Sort
View
SPAA
1996
ACM
15 years 1 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
PE
2010
Springer
138views Optimization» more  PE 2010»
14 years 8 months ago
Trace data characterization and fitting for Markov modeling
We propose a trace fitting algorithm for Markovian Arrival Processes (MAPs) that can capture statistics of any order of interarrival times between measured events. By studying re...
Giuliano Casale, Eddy Z. Zhang, Evgenia Smirni
CORR
2011
Springer
142views Education» more  CORR 2011»
14 years 1 months ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp
CG
2007
Springer
14 years 9 months ago
Graphtracker: A topology projection invariant optical tracker
In this paper, we describe a new optical tracking algorithm for pose estimation of interaction devices in virtual and augmented reality. Given a 3D model of the interaction device...
Ferdi A. Smit, Arjen van Rhijn, Robert van Liere
JSAT
2008
113views more  JSAT 2008»
14 years 9 months ago
Combining Adaptive and Dynamic Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...