Sciweavers

2526 search results - page 98 / 506
» A New Algorithm for Answer Set Computation
Sort
View
120
Voted
TCS
2011
14 years 9 months ago
Block insertion and deletion on trajectories
In this paper, we introduce block insertion and deletion on trajectories, which provide us with a new framework to study properties of language operations. With the parallel synta...
Bo Cui, Lila Kari, Shinnosuke Seki
107
Voted
JMLR
2010
92views more  JMLR 2010»
14 years 9 months ago
Posterior distributions are computable from predictive distributions
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
Cameron E. Freer, Daniel M. Roy
126
Voted
WG
2005
Springer
15 years 8 months ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...
138
Voted
APPROX
2004
Springer
100views Algorithms» more  APPROX 2004»
15 years 8 months ago
Estimating the Distance to a Monotone Function
In standard property testing, the task is to distinguish between objects that have a property P and those that are ε-far from P, for some ε > 0. In this setting, it is perfec...
Nir Ailon, Bernard Chazelle, Seshadhri Comandur, D...
AI
2007
Springer
15 years 8 months ago
Competition and Coordination in Stochastic Games
Agent competition and coordination are two classical and most important tasks in multiagent systems. In recent years, there was a number of learning algorithms proposed to resolve ...
Andriy Burkov, Abdeslam Boularias, Brahim Chaib-dr...