Sciweavers

2766 search results - page 458 / 554
» Algorithms for trigonometric polynomials
Sort
View
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
16 years 26 days ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...
CSR
2009
Springer
16 years 26 days ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...
ESWS
2009
Springer
16 years 26 days ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
GECCO
2009
Springer
16 years 26 days ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
SAGT
2009
Springer
113views Game Theory» more  SAGT 2009»
16 years 25 days ago
Games with Congestion-Averse Utilities
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...
Andrew Byde, Maria Polukarov, Nicholas R. Jennings