Sciweavers

1199 search results - page 211 / 240
» Parameterized Proof Complexity
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 7 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
CORR
2008
Springer
149views Education» more  CORR 2008»
13 years 7 months ago
Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
Jialing Liu, Vikas Yadav, Hullas Sehgal, Joshua M....
EJC
2008
13 years 7 months ago
On tension-continuous mappings
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
Jaroslav Nesetril, Robert Sámal
FUIN
2006
95views more  FUIN 2006»
13 years 7 months ago
Multistrategy Operators for Relational Learning and Their Cooperation
Traditional Machine Learning approaches based on single inference mechanisms have reached their limits. This causes the need for a framework that integrates approaches based on aba...
Floriana Esposito, Nicola Fanizzi, Stefano Ferilli...
IANDC
2006
103views more  IANDC 2006»
13 years 7 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...