Sciweavers

500 search results - page 54 / 100
» On the Hardness of Being Truthful
Sort
View
FSTTCS
2010
Springer
14 years 9 months ago
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
Sebastian Ordyniak, Daniël Paulusma, Stefan S...
WCET
2010
14 years 9 months ago
METAMOC: Modular Execution Time Analysis using Model Checking
Safe and tight worst-case execution times (WCETs) are important when scheduling hard realtime systems. This paper presents METAMOC, a modular method, based on model checking and s...
Andreas E. Dalsgaard, Mads Chr. Olesen, Martin Tof...
DMIN
2009
136views Data Mining» more  DMIN 2009»
14 years 9 months ago
Evaluating Algorithms for Concept Description
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...
Cecilia Sönströd, Ulf Johansson, Tuve L&...
DEBU
2010
113views more  DEBU 2010»
14 years 9 months ago
Storage Class Memory Aware Data Management
Storage Class Memory (SCM) is here to stay. It has characteristics that place it in a class apart both from main memory and hard disk drives. Software and systems, architectures a...
Bishwaranjan Bhattacharjee, Mustafa Canim, Christi...
ACSC
2010
IEEE
14 years 6 months ago
Analysis of the periodical payment framework using restricted proxy certificates
This paper discusses the design and implementation of a payment framework that is loosely based on the direct debit payment model. We define such payments as one in which customer...
Grigori Goldman, Lawrie Brown