3663 search results - page 446 / 733 » Problems in the ontology of computer programs |
153
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
194
click to vote
CP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
147
Voted
WCNC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...
218
click to vote
PATAT
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. Service network design is critical to the profitability of express shipment carriers. In this paper, we consider the problem of designing the integrated service network ...
200
click to vote
CP
1997
Springer
15 years 11 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...