2412 search results - page 114 / 483 » Which Problems Have Strongly Exponential Complexity |
132
click to vote
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
158
Voted
PLANX
2007
15 years 4 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
158
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
159
click to vote
ICDM
2002
IEEE
15 years 8 months ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
125
click to vote
CAEPIA
2007
Springer
15 years 9 months ago
2007
Springer
Consider a robot whose task is to pick up some colored balls from a grid, taking the red balls to a red spot, the blue balls to a blue spot and so on, one by one, without knowing e...