427 search results - page 49 / 86 » Sequential predictions based on algorithmic complexity |
140
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
204
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
124
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
122
Voted
AAMAS
2010
Springer
15 years 2 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
142
Voted
BMCBI
2007
15 years 2 months ago
2007
Background: Since many of the new protein structures delivered by high-throughput processes do not have any known function, there is a need for structure-based prediction of prote...