Sciweavers

2446 search results - page 277 / 490
» Choiceless Polynomial Time
Sort
View
APPROX
2004
Springer
125views Algorithms» more  APPROX 2004»
14 years 1 months ago
Strong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
Amin Coja-Oghlan, Andreas Goerdt, André Lan...
ATAL
2004
Springer
14 years 1 months ago
RDS: Remote Distributed Scheme for Protecting Mobile Agents
As of today no solely software-based solution that a priori protects the computation of any mobile code and/or mobile agent was presented. Furthermore, Algesheimer et al. [1], arg...
Asnat Dadon-Elichai
COLT
2004
Springer
14 years 1 months ago
Graphical Economics
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
Sham Kakade, Michael J. Kearns, Luis E. Ortiz
FOIKS
2004
Springer
14 years 1 months ago
Query Answering and Containment for Regular Path Queries under Distortions
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
Gösta Grahne, Alex Thomo
HYBRID
2004
Springer
14 years 1 months ago
Approximations of the Rate of Growth of Switched Linear Systems
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This...
Vincent D. Blondel, Yurii Nesterov, Jacques Theys