Sciweavers

882 search results - page 110 / 177
» On the Hardness of Graph Isomorphism
Sort
View
EUROGP
2005
Springer
122views Optimization» more  EUROGP 2005»
14 years 2 months ago
Evolution of Robot Controller Using Cartesian Genetic Programming
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
Simon Harding, Julian F. Miller
TACAS
2004
Springer
127views Algorithms» more  TACAS 2004»
14 years 2 months ago
MetaGame: An Animation Tool for Model-Checking Games
Abstract. Failing model checking runs should be accompanied by appropriate error diagnosis information that allows the user to identify the cause of the problem. For branching time...
Markus Müller-Olm, Haiseung Yoo
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
13 years 10 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
APAL
2008
84views more  APAL 2008»
13 years 8 months ago
Resolution over linear equations and multilinear proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
Ran Raz, Iddo Tzameret
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 8 months ago
Removing Local Extrema from Imprecise Terrains
In this paper, we study imprecise terrains, that is, triangulated terrains with a vertical error interval in the vertices. We study the problem of removing as many local extrema (...
Chris Gray, Frank Kammer, Maarten Löffler, Ro...