Sciweavers

504 search results - page 97 / 101
» The Complexity of Symmetry-Breaking Formulas
Sort
View
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
14 years 2 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
FLAIRS
2007
14 years 1 months ago
Indexing Documents by Discourse and Semantic Contents from Automatic Annotations of Texts
The basic aim of the model proposed here is to automatically build semantic metatext structure for texts that would allow us to search and extract discourse and semantic informati...
Brahim Djioua, Jean-Pierre Desclés
AAAI
2006
14 years 8 days ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
FSTTCS
2008
Springer
13 years 12 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
BMCBI
2007
128views more  BMCBI 2007»
13 years 11 months ago
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assess
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
Paolo Ferragina, Raffaele Giancarlo, Valentina Gre...