14649 search results - page 218 / 2930 » Principles of problem solving |
187
click to vote
ASP
2005
Springer
15 years 12 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
147
Voted
CAV
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
156
click to vote
CPC
2006
15 years 6 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
161
click to vote
IEAAIE
2003
Springer
15 years 11 months ago
2003
Springer
Integration of heterogeneous statistics is essential for political decision making on all levels. Like in intelligent information integration in general, the problem is to combine ...
187
click to vote
AMAI
2000
Springer
15 years 10 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...