655 search results - page 13 / 131 » On Flat Programs with Lists |
LFP
1990
13 years 8 months ago
1990
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...
AGP
2010
IEEE
13 years 5 months ago
2010
IEEE
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...
EOR
2010
13 years 7 months ago
2010
We study a network airline revenue management problem with discrete customer choice behavior. We discuss a choice model based on the concept of preference orders, in which custome...
SIGECOM
2000
ACM
13 years 12 months ago
2000
ACM
Using data collected between August 1999 and January 2000, we examine firm-level pricing strategies for 32 online bookstores. The data cover more than 300 books, including New Yor...
EKAW
2006
Springer
13 years 11 months ago
2006
Springer
Existing ontology matching algorithms use a combination of lexical and structural correspondance between source and target ontologies. We present a realistic case-study where both ...