Sciweavers

1392 search results - page 86 / 279
» Staging generic programming
Sort
View
EACL
2009
ACL Anthology
14 years 9 months ago
Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
Kevin Gimpel, Noah A. Smith
GPCE
2005
Springer
14 years 2 months ago
Optimizing Marshalling by Run-Time Program Generation
Saving the internal data of an application in an external form is called marshalling. A generic marshaller is difficult to optimize because the format of the data that will be mars...
Baris Aktemur, Joel Jones, Samuel N. Kamin, Lars C...
PPDP
2004
Springer
14 years 2 months ago
A lazy narrowing calculus for declarative constraint programming
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
Francisco Javier López-Fraguas, Mario Rodr&...
CP
2010
Springer
13 years 7 months ago
A Systematic Approach to MDD-Based Constraint Programming
Abstract. Fixed-width MDDs were introduced recently as a more refined alternative for the domain store to represent partial solutions to CSPs. In this work, we present a systemati...
Samid Hoda, Willem Jan van Hoeve, John N. Hooker
ICLP
2009
Springer
14 years 9 months ago
Logic Programming for Multiagent Planning with Negotiation
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their...
Tran Cao Son, Enrico Pontelli, Chiaki Sakama