192 search results - page 28 / 39 » Cut Points in PEG |
149
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
161
click to vote
EPIA
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
147
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
Abstract—In many sensor networks applications, sensors collect correlated measurements of a physical field, e.g., temperature field in a building or in a data center. However, ...
141
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
160
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively com...