2370 search results - page 177 / 474 » The Characterization of Data-Accumulating Algorithms |
118
Voted
LPNMR
1995
Springer
15 years 1 months ago
1995
Springer
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...
96
Voted
AAAI
2008
15 years 16 days ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
95
Voted
EUROPAR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs characterize the behavior of code ...
NIPS
2008
14 years 11 months ago
2008
Empirical evidence shows that in favorable situations semi-supervised learning (SSL) algorithms can capitalize on the abundance of unlabeled training data to improve the performan...
IPCO
2007
14 years 11 months ago
2007
We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of t...