Sciweavers

3690 search results - page 73 / 738
» Computation with classical sequents
Sort
View
NMR
2004
Springer
15 years 3 months ago
A possibilistic approach to restore consistency in answer set programming
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
MOC
2011
14 years 4 months ago
Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
Len Bos, Jean-Paul Calvi, Norman Levenberg, Alvise...
IJMMS
2007
195views more  IJMMS 2007»
14 years 9 months ago
Berlin Brain-Computer Interface - The HCI communication channel for discovery
The investigation of innovative Human–Computer Interfaces (HCI) provides a challenge for future interaction research and development. Brain–Computer Interfaces (BCIs) exploit ...
Roman Krepki, Gabriel Curio, Benjamin Blankertz, K...
ECAI
2006
Springer
15 years 1 months ago
Cheating Is Not Playing: Methodological Issues of Computational Game Theory
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
Bruno Beaufils, Philippe Mathieu
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...