2398 search results - page 305 / 480 » Constraint Programming and Graph Algorithms |
175
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
146
click to vote
POPL
2000
ACM
15 years 10 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
166
click to vote
ICDCS
2006
IEEE
16 years 9 days ago
2006
IEEE
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
162
click to vote
GLVLSI
2006
IEEE
16 years 10 days ago
2006
IEEE
In this paper we have applied statistical sizing in an industrial setting. Efficient implementation of the statistical sizing algorithm is achieved by utilizing a dedicated interi...
162
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...