Sciweavers

11321 search results - page 6 / 2265
» Improvements to Turing's method
Sort
View
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 11 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
NETWORKS
2008
13 years 7 months ago
A simple method for improving the primal simplex method for the multicommodity flow problem
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...
Agustín Bompadre, James B. Orlin
ECOOP
2001
Springer
13 years 12 months ago
Feature Interaction and Composition Problems in Software Product Lines
Features are essential characteristic of applications within a product line. Features organized in different kinds of diagrams containing hierarchies of feature trees are closely ...
Silva Robak, Bogdan Franczyk
CVPR
2009
IEEE
15 years 2 months ago
Building text features for object image classification
We introduce a text-based image feature and demon- strate that it consistently improves performance on hard object classification problems. The feature is built using an auxilia...
David A. Forsyth, Derek Hoiem, Gang Wang
ATVA
2007
Springer
153views Hardware» more  ATVA 2007»
14 years 1 months ago
Continuous Petri Nets: Expressive Power and Decidability Issues
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models. The expected...
Laura Recalde, Serge Haddad, Manuel Silva