Sciweavers

1071 search results - page 32 / 215
» Programming with enumerable sets of structures
Sort
View
LPNMR
2009
Springer
14 years 5 months ago
Belief Revision with Bounded Treewidth
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 9 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
BMCBI
2005
119views more  BMCBI 2005»
13 years 10 months ago
GASH: An improved algorithm for maximizing the number of equivalent residues between two protein structures
Background: We introduce GASH, a new, publicly accessible program for structural alignment and superposition. Alignments are scored by the Number of Equivalent Residues (NER), a q...
Daron M. Standley, Hiroyuki Toh, Haruki Nakamura
PODC
2010
ACM
14 years 2 months ago
Transactional predication: high-performance concurrent sets and maps for STM
Concurrent collection classes are widely used in multi-threaded programming, but they provide atomicity only for a fixed set of operations. Software transactional memory (STM) pr...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
ICDE
2008
IEEE
167views Database» more  ICDE 2008»
15 years 9 days ago
Towards Declarative Queries on Adaptive Data Structures
In this work we look at combining emerging technologies in programming languages with traditional query processing techniques to provide support for efficient execution of declarat...
Nicolas Bruno, Pablo Castro