20441 search results - page 487 / 4089 » Locally Computable Structures |
191
click to vote
IJCAI
2001
15 years 8 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
181
click to vote
JMLR
2002
15 years 6 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
175
click to vote
SIAMCO
2010
15 years 1 months ago
2010
We study a system coupling the incompressible Navier-Stokes equations in a 2D rectangular type domain with a damped Euler-Bernoulli beam equation, where the beam is a part of the u...
194
click to vote
VLDB
1999
ACM
15 years 11 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
175
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We discuss the realization of evaluation strategies for the concurrent constraint-based functional language ccfl within the translation schemata when compiling ccfl programs into t...