Sciweavers

1698 search results - page 5 / 340
» Growing Complex Games
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
15 years 6 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 3 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
BMCBI
2007
227views more  BMCBI 2007»
14 years 11 months ago
Growing functional modules from a seed protein via integration of protein interaction and gene expression data
Background: Nowadays modern biology aims at unravelling the strands of complex biological structures such as the protein-protein interaction (PPI) networks. A key concept in the o...
Ioannis A. Maraziotis, Konstantina Dimitrakopoulou...
BCS
2008
15 years 1 months ago
On the Complexity of Parity Games
Parity games underlie the model checking problem for the modal
Arnold Beckmann, Faron Moller
ICIP
2006
IEEE
16 years 1 months ago
Developing an Efficient Region Growing Engine for Image Segmentation
Image segmentation is a crucial part of image processing applications. Currently available approaches require significant computer power to handle large images. We present an effi...
Emanuel Gofman