Sciweavers

17 search results - page 3 / 4
» Monotonic solution concepts in coevolution
Sort
View
AAAI
2008
13 years 8 months ago
A Computational Analysis of the Tournament Equilibrium Set
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
NAR
2006
71views more  NAR 2006»
13 years 6 months ago
TSEMA: interactive prediction of protein pairings between interacting families
An entire family of methodologies for predicting protein interactions is based on the observed fact that families of interacting proteins tend to have similar phylogenetic trees d...
José M. G. Izarzugaza, David de Juan, Carle...
CAV
2005
Springer
104views Hardware» more  CAV 2005»
13 years 11 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...
CVPR
2011
IEEE
12 years 9 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
ASMTA
2008
Springer
167views Mathematics» more  ASMTA 2008»
13 years 8 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber