Sciweavers

1989 search results - page 252 / 398
» Set functions for functional logic programming
Sort
View
ML
2008
ACM
15 years 3 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
MP
2008
135views more  MP 2008»
15 years 3 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
MP
2010
92views more  MP 2010»
14 years 10 months ago
Single item lot-sizing with non-decreasing capacities
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
Yves Pochet, Laurence A. Wolsey
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 3 months ago
A Homogeneous Reaction Rule Language for Complex Event Processing
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
Adrian Paschke, Alexander Kozlenkov, Harold Boley
151
Voted
HIPEAC
2009
Springer
15 years 10 months ago
Collective Optimization
Abstract. Iterative compilation is an efficient approach to optimize programs on rapidly evolving hardware, but it is still only scarcely used in practice due to a necessity to gat...
Grigori Fursin, Olivier Temam