Sciweavers

8825 search results - page 1731 / 1765
» All for one or one for all
Sort
View
102
Voted
CONCURRENCY
1998
139views more  CONCURRENCY 1998»
15 years 14 days ago
Applications experience in Jade
This paper presents our experience developing applications in Jade, a portable, implicitly parallel programming language designed for exploiting task-level concurrency. Jade progr...
Martin C. Rinard
ECCC
1998
105views more  ECCC 1998»
15 years 13 days ago
Pseudorandom generators without the XOR Lemma
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
Madhu Sudan, Luca Trevisan, Salil P. Vadhan
120
Voted
CORR
1999
Springer
98views Education» more  CORR 1999»
15 years 13 days ago
A variational description of the ground state structure in random satisfiability problems
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
Giulio Biroli, Rémi Monasson, Martin Weigt
118
Voted
KI
2002
Springer
15 years 13 days ago
Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
Bernhard Nebel, Alexander Scivos
MP
2002
165views more  MP 2002»
15 years 13 days ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi
« Prev « First page 1731 / 1765 Last » Next »