Sciweavers

1092 search results - page 78 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
CIS
2004
Springer
15 years 11 months ago
Algorithms for Loosely Constrained Multiple Sequence Alignment
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
Bin Song, Fengfeng Zhou, Guoliang Chen
NIPS
2004
15 years 7 months ago
Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments
A reactive environment is one that responds to the actions of an agent rather than evolving obliviously. In reactive environments, experts algorithms must balance exploration and ...
Daniela Pucci de Farias, Nimrod Megiddo
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 29 days ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 10 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
STACS
1993
Springer
15 years 10 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob