Sciweavers

874 search results - page 56 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
13 years 12 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
RECOMB
2009
Springer
14 years 8 months ago
Searching Protein 3-D Structures in Linear Time
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
Tetsuo Shibuya
CAV
2008
Springer
96views Hardware» more  CAV 2008»
13 years 9 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
ECML
2006
Springer
13 years 11 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
AAAI
2010
13 years 9 months ago
Multi-Agent Learning with Policy Prediction
Due to the non-stationary environment, learning in multi-agent systems is a challenging problem. This paper first introduces a new gradient-based learning algorithm, augmenting th...
Chongjie Zhang, Victor R. Lesser