Sciweavers

699 search results - page 61 / 140
» The method of combinatorial telescoping
Sort
View
CSCLP
2006
Springer
15 years 4 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
91
Voted
RECOMB
2010
Springer
15 years 2 months ago
Subnetwork State Functions Define Dysregulated Subnetworks in Cancer
Abstract. Emerging research demonstrates the potential of proteinprotein interaction (PPI) networks in uncovering the mechanistic bases of cancers, through identification of intera...
Salim A. Chowdhury, Rod K. Nibbe, Mark R. Chance, ...
99
Voted
IJCAI
2001
15 years 1 months ago
The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
Dale Schuurmans, Finnegan Southey, Robert C. Holte
BMEI
2009
IEEE
15 years 1 months ago
Analysis of the Bipartite Networks of Domain Compositions and Metabolic Reactions
It is widely accepted that complexity of biological systems arises from combinations of common subunits. In this work we investigate the combinatorial patterns of protein domains ...
Chen-Hsiang Yeang
115
Voted
JCC
2006
69views more  JCC 2006»
15 years 16 days ago
Dramatic performance enhancements for the FASTER optimization algorithm
: FASTER is a combinatorial optimization algorithm useful for finding low-energy side-chain configurations in side-chain placement and protein design calculations. We present two s...
Benjamin D. Allen, Stephen L. Mayo