Sciweavers

15754 search results - page 416 / 3151
» Programs are Knowledge Bases
Sort
View
CPAIOR
2004
Springer
16 years 7 days ago
Simple Rules for Low-Knowledge Algorithm Selection
This paper addresses the question of selecting an algorithm from a predefined set that will have the best performance on a scheduling problem instance. Our goal is to reduce the e...
J. Christopher Beck, Eugene C. Freuder
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
15 years 11 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines
EUROCRYPT
2000
Springer
15 years 10 months ago
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
Ivan Damgård
AAAI
2008
15 years 9 months ago
Extending the Knowledge Compilation Map: Krom, Horn, Affine and Beyond
We extend the knowledge compilation map introduced by Darwiche and Marquis with three influential propositional fragments, the Krom CNF one (also known as the bijunctive fragment)...
Hélène Fargier, Pierre Marquis
AAAI
2004
15 years 8 months ago
Low-Knowledge Algorithm Control
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
Tom Carchrae, J. Christopher Beck