402 search results - page 49 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
IMR
2005
Springer
14 years 2 months ago
2005
Springer
This paper describes an interior surface generation method and a strategy for all-hexahedral mesh generation. It is well known that a solid homeomorphic to a ball with even number...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
BMCBI
2010
13 years 8 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
CONCUR
2007
Springer
14 years 2 months ago
2007
Springer
Scenario languages based on Message Sequence Charts (MSCs) have been widely studied in the last decade [21,20,3,15,12,19,14]. The high expressive power of MSCs renders many basic ...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
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...