Sciweavers

371 search results - page 59 / 75
» An anytime algorithm for optimal coalition structure generat...
Sort
View
BIOINFORMATICS
2007
151views more  BIOINFORMATICS 2007»
13 years 9 months ago
A new protein-protein docking scoring function based on interface residue properties
Motivation: Protein–protein complexes are known to play key roles in many cellular processes. However, they are often not accessible to experimental study because of their low s...
Julie Bernauer, Jérôme Azé, Jo...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 9 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
CORR
2011
Springer
142views Education» more  CORR 2011»
13 years 17 days ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
14 years 16 days ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
IACR
2011
136views more  IACR 2011»
12 years 8 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert