3693 search results - page 376 / 739 » Splitting a Logic Program |
125
click to vote
CTCS
1989
Springer
15 years 8 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
134
click to vote
HPCA
2008
IEEE
16 years 4 months ago
2008
IEEE
The continued scaling of device dimensions and the operating voltage reduces the critical charge and thus natural noise tolerance level of transistors. As a result, circuits can p...
136
click to vote
LCTRTS
2007
Springer
15 years 10 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
143
click to vote
IJCAI
1993
15 years 5 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
145
click to vote
IOR
2007
15 years 4 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...