Sciweavers

1615 search results - page 262 / 323
» Computer science and decision theory
Sort
View
138
Voted
PDCN
2004
15 years 5 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
122
Voted
CPHYSICS
2008
96views more  CPHYSICS 2008»
15 years 4 months ago
Moment distributions of clusters and molecules in the adiabatic rotor model
We present a Fortran program to compute the distribution of dipole moments of free particles for use in analyzing molecular beams experiments that measure moments by deflection in...
G. E. Ballentine, G. F. Bertsch, N. Onishi, K. Yab...
STACS
2010
Springer
15 years 11 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
FOCS
2008
IEEE
15 years 10 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
129
Voted
AAAI
1990
15 years 5 months ago
The Design of a Marker Passing Architecture for Knowledge Processing
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
Wing Lee, Dan I. Moldovan