Sciweavers

543 search results - page 68 / 109
» New Upper Bounds for MaxSat
Sort
View
AAAI
2010
14 years 11 months ago
Can Approximation Circumvent Gibbard-Satterthwaite?
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
Ariel D. Procaccia
JVM
2001
97views Education» more  JVM 2001»
14 years 11 months ago
Deterministic Execution of Java's Primitive Bytecode Operations
For the application of Java in realtime and safety critical domains, an analysis of the worst-case execution times of primitive Java operations is necessary. All primitive operati...
Fridtjof Siebert, Andy Walter
AAAI
1996
14 years 11 months ago
Goal Oriented Symbolic Propagation in Bayesian Networks
The paper presents an efficient goal oriented algorithm for symbolic propagation in Bayesian networks. The proposed algorithm performs symbolic propagation using numerical methods...
Enrique Castillo, José Manuel Gutiér...
ACL
1996
14 years 11 months ago
Another Facet of LIG Parsing
In this paper 1 we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining ...
Pierre Boullier
CPM
2009
Springer
102views Combinatorics» more  CPM 2009»
14 years 10 months ago
Statistical Properties of Factor Oracles
Factor and suffix oracles have been introduced in [1] in order to provide an economic and efficient solution for storing all the factors and suffixes respectively of a given text. ...
Jérémie Bourdon, Irena Rusu