Sciweavers

260 search results - page 47 / 52
» Hardness of Parameterized Resolution
Sort
View
SAT
2009
Springer
117views Hardware» more  SAT 2009»
14 years 2 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
ICTAI
2008
IEEE
14 years 2 months ago
The Performance of Approximating Ordinary Differential Equations by Neural Nets
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
Josef Fojdl, Rüdiger W. Brause
CCS
2007
ACM
14 years 1 months ago
A simple and expressive semantic framework for policy composition in access control
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...
Glenn Bruns, Daniel S. Dantas, Michael Huth
IPSN
2007
Springer
14 years 1 months ago
LaserSPECks: : laser SPECtroscopic trace-gas sensor networks - sensor integration and applications
We introduce a novel laser spectroscopic trace-gas sensor platform, LaserSPECks that integrates recently developed miniature quartz-enhanced photoacoustic spectroscopy (QEPAS) gas...
Stephen So, Farinaz Koushanfar, Anatoliy Kosterev,...
FOCS
2006
IEEE
14 years 1 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák