Sciweavers

2398 search results - page 24 / 480
» Constraint Programming and Graph Algorithms
Sort
View
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 1 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
AI
1999
Springer
13 years 8 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
SEMWEB
2010
Springer
13 years 6 months ago
Signal/Collect: Graph Algorithms for the (Semantic) Web
The Semantic Web graph is growing at an incredible pace, enabling opportunities to discover new knowledge by interlinking and analyzing previously unconnected data sets. This confr...
Philip Stutz, Abraham Bernstein, William Cohen
CSB
2005
IEEE
129views Bioinformatics» more  CSB 2005»
14 years 2 months ago
A Pivoting Algorithm for Metabolic Networks in the Presence of Thermodynamic Constraints
A linear programming algorithm is presented to constructively compute thermodynamically feasible fluxes and change in chemical potentials of reactions for a metabolic network. It...
R. Nigam, S. Liang
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
14 years 20 days ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran