Sciweavers

364 search results - page 41 / 73
» Generalized normal forms and polynomial system solving
Sort
View
CIE
2007
Springer
15 years 3 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
EMSOFT
2004
Springer
15 years 3 months ago
Practical PACE for embedded systems
In current embedded systems, one of the major concerns is energy conservation. The dynamic voltage-scheduling (DVS) framework, which involves dynamically adjusting the voltage and...
Ruibin Xu, Chenhai Xi, Rami G. Melhem, Daniel Moss...
FC
1998
Springer
96views Cryptology» more  FC 1998»
15 years 1 months ago
Compliance Checking in the PolicyMaker Trust Management System
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...
Matt Blaze, Joan Feigenbaum, Martin Strauss
DAC
1999
ACM
15 years 2 months ago
Multi-Time Simulation of Voltage-Controlled Oscillators
We present a novel formulation, called the WaMPDE, for solving systems with forced autonomous components. An important feature of the WaMPDE is its ability to capture frequency mo...
Onuttom Narayan, Jaijeet S. Roychowdhury
ISTCS
1997
Springer
15 years 1 months ago
Learning with Queries Corrupted by Classification Noise
Kearns introduced the "statistical query" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this ...
Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman