2989 search results - page 500 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
IPPS
1997
IEEE
15 years 2 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
104
click to vote
CPHYSICS
2006
14 years 10 months ago
2006
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of in...
ICFP
2010
ACM
14 years 11 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
In traditional text clustering methods, documents are represented as "bags of words" without considering the semantic information of each document. For instance, if two ...