Sciweavers

1245 search results - page 116 / 249
» Playing with Conway's problem
Sort
View
ECCC
2006
145views more  ECCC 2006»
13 years 10 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 8 months ago
Stochastic Budget Optimization in Internet Advertising
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
Bhaskar DasGupta, S. Muthukrishnan
FSTTCS
2010
Springer
13 years 8 months ago
One-Counter Stochastic Games
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
Tomás Brázdil, Václav Brozek,...
BMCBI
2008
116views more  BMCBI 2008»
13 years 10 months ago
IgTM: An algorithm to predict transmembrane domains and topology in proteins
Background: Due to their role of receptors or transporters, membrane proteins play a key role in many important biological functions. In our work we used Grammatical Inference (GI...
Piedachu Peris, Damián López, Marcel...
BMCBI
2008
127views more  BMCBI 2008»
13 years 10 months ago
Human Pol II promoter recognition based on primary sequences and free energy of dinucleotides
Background: Promoter region plays an important role in determining where the transcription of a particular gene should be initiated. Computational prediction of eukaryotic Pol II ...
Jian-Yi Yang, Yu Zhou, Zu-Guo Yu, Vo Anh, Li-Qian ...