Sciweavers

8094 search results - page 352 / 1619
» Improvements in Formula Generalization
Sort
View
RTAS
2005
IEEE
15 years 12 months ago
On Schedulability Bounds of Static Priority Schedulers
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao
SIGMOD
2005
ACM
123views Database» more  SIGMOD 2005»
15 years 11 months ago
To Do or Not To Do: The Dilemma of Disclosing Anonymized Data
Decision makers of companies often face the dilemma of whether to release data for knowledge discovery, vis a vis the risk of disclosing proprietary or sensitive information. Whil...
Laks V. S. Lakshmanan, Raymond T. Ng, Ganesh Rames...
ATAL
2005
Springer
15 years 11 months ago
Dynamic epistemic logic with assignment
We add assignment operators to languages for epistemic actions, so that change of knowledge and change of facts can be combined in specifications of multi-agent system dynamics. ...
Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld...
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
15 years 11 months ago
New Results on the Complexity of the Middle Bit of Multiplication
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
Ingo Wegener, Philipp Woelfel
EPIA
2005
Springer
15 years 11 months ago
Reducing Propositional Theories in Equilibrium Logic to Logic Programs
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
Pedro Cabalar, David Pearce, Agustín Valver...