Sciweavers

3228 search results - page 299 / 646
» Computationally Sound Proofs
Sort
View
ENTCS
2002
110views more  ENTCS 2002»
15 years 4 months ago
Uniform Solution of Parity Games on Prefix-Recognizable Graphs
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
Thierry Cachat
INFORMATICALT
2010
91views more  INFORMATICALT 2010»
15 years 2 months ago
An Expansion of the Neural Network Theory by Introducing Hebb Postulate
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...
Algis Garliauskas
MST
2010
105views more  MST 2010»
15 years 2 months ago
On the Automatizability of Polynomial Calculus
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
Nicola Galesi, Massimo Lauria
DISOPT
2011
176views Education» more  DISOPT 2011»
14 years 8 months ago
Valid inequalities and branch-and-cut for the clique pricing problem
Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation net...
Géraldine Heilporn, Martine Labbé, P...
RECSYS
2009
ACM
15 years 11 months ago
Regret-based optimal recommendation sets in conversational recommender systems
Current conversational recommender systems are unable to offer guarantees on the quality of their recommendations due to a lack of principled user utility models. We develop an ap...
Paolo Viappiani, Craig Boutilier