Sciweavers

4679 search results - page 268 / 936
» Modeling When Connections Are the Problem
Sort
View
CPAIOR
2010
Springer
15 years 4 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
RECOMB
2001
Springer
16 years 6 months ago
Context-specific Bayesian clustering for gene expression data
The recent growth in genomic data and measurements of genome-wide expression patterns allows us to apply computational tools to examine gene regulation by transcription factors. I...
Yoseph Barash, Nir Friedman
SECON
2007
IEEE
16 years 26 days ago
Log-normal shadowing meets SINR: A numerical study of Capacity in Wireless Networks
— The capacity of wireless multi-hop networks has been studied extensively in recent years. Most existing work tackles the problem from an asymptotic perspective and assumes a si...
Patrick Stuedi, Gustavo Alonso
USS
2008
15 years 9 months ago
Securing Provenance
Provenance describes how an object came to be in its present state. Intelligence dossiers, medical records and corporate financial reports capture provenance information. Many of ...
Uri Braun, Avraham Shinnar, Margo I. Seltzer
LADS
2007
Springer
16 years 22 days ago
Measuring Complexity of Multi-agent Simulations - An Attempt Using Metrics
Abstract The variety of existing agent-based simulations is overwhelming. However – especially when comparing agent-based simulation to other simulation paradigms, a reference fr...
Franziska Klügl