Sciweavers

350 search results - page 53 / 70
» Branching Programs for Tree Evaluation
Sort
View
POPL
2011
ACM
12 years 10 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
LION
2009
Springer
135views Optimization» more  LION 2009»
14 years 2 months ago
Neural Network Pairwise Interaction Fields for Protein Model Quality Assessment
We present a new knowledge-based Model Quality Assessment Program (MQAP) at the residue level which evaluates single protein structure models. We use a tree representation of the ...
Alberto J. M. Martin, Alessandro Vullo, Gianluca P...
FBIT
2007
IEEE
14 years 2 months ago
Rough Set Based Information Retrieval from Argumentative Data Points in Weblogs
This paper describes a decision tree model and 3dimensional representation of information retrieved from various weblogs in relation to argumentative logics. The weblogs are consi...
Sea Woo Kim, Chin-Wan Chung
CP
2004
Springer
14 years 1 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
AI
2002
Springer
13 years 7 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo