Sciweavers

3311 search results - page 527 / 663
» Deductive Object Programming
Sort
View
CORR
2008
Springer
85views Education» more  CORR 2008»
14 years 10 months ago
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
Paul Tarau
105
Voted
ENDM
2010
136views more  ENDM 2010»
14 years 10 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
ENTCS
2008
97views more  ENTCS 2008»
14 years 10 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
Karl-Heinz Pennemann
EOR
2008
150views more  EOR 2008»
14 years 10 months ago
Portfolio optimization when asset returns have the Gaussian mixture distribution
Abstract. Portfolios of assets whose returns have the Gaussian mixture distribution are optimized in the static setting to find portfolio weights and efficient frontiers using the ...
Ian Buckley, David Saunders, Luis Seco
101
Voted
CL
2006
Springer
14 years 10 months ago
Tailorable language for behavioral composition and configuration of software components
Many software systems suffer from missing support for behavioral (runtime) composition and configuration of software components. The concern "behavioral composition and confi...
Uwe Zdun