Sciweavers

1887 search results - page 202 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
STOC
1993
ACM
87views Algorithms» more  STOC 1993»
14 years 1 months ago
How to use expert advice
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
Nicolò Cesa-Bianchi, Yoav Freund, David P. ...
GCB
2000
Springer
99views Biometrics» more  GCB 2000»
14 years 27 days ago
Structure Motif Discovery and Mining the PDB
We describe an algorithm for the automatic discovery of recurring patterns in protein structures. The patterns consist of individual residues having a defined order along the prote...
Inge Jonassen, Ingvar Eidhammer, Darrell Conklin, ...
CORR
2009
Springer
74views Education» more  CORR 2009»
13 years 7 months ago
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states re...
Fuad Abujarad, Borzoo Bonakdarpour, Sandeep S. Kul...
ASC
2011
13 years 4 months ago
A note on the learning automata based algorithms for adaptive parameter selection in PSO
: PSO, like many stochastic search methods, is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. I...
Ali B. Hashemi, Mohammad Reza Meybodi
ICTAI
2005
IEEE
14 years 2 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze