Sciweavers

18306 search results - page 95 / 3662
» Algorithmics in Exponential Time
Sort
View
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
15 years 2 months ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum
AAAI
2010
14 years 11 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
ECIR
2007
Springer
14 years 11 months ago
Personalized Communities in a Distributed Recommender System
The amount of data exponentially increases in information systems and it becomes more and more difficult to extract the most relevant information within a very short time. Among ot...
Sylvain Castagnos, Anne Boyer
CORR
2009
Springer
115views Education» more  CORR 2009»
14 years 7 months ago
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
Marco Almeida, Nelma Moreira, Rogério Reis
CORR
2010
Springer
39views Education» more  CORR 2010»
14 years 7 months ago
Non-redundant random generation from weighted context-free languages
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
Yann Ponty