Sciweavers

15 search results - page 2 / 3
» One-Time Programs
Sort
View
VL
1999
IEEE
104views Visual Languages» more  VL 1999»
13 years 10 months ago
Pragmatic Graph Rewriting Modifications
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host...
Peter J. Rodgers, Natalia Vidal
EOR
2007
93views more  EOR 2007»
13 years 6 months ago
An integrated approach for deriving priorities in analytic network process
A multiple objective programming approach for the analytic network process (ANP) is proposed to obtain all local priorities for crisp or interval judgments at one time, even in an...
Jing-Rung Yu, Sheu-Ji Cheng
JMLR
2012
11 years 8 months ago
Gaussian Processes for time-marked time-series data
In many settings, data is collected as multiple time series, where each recorded time series is an observation of some underlying dynamical process of interest. These observations...
John Cunningham, Zoubin Ghahramani, Carl Edward Ra...
MP
1998
76views more  MP 1998»
13 years 6 months ago
Warm start of the primal-dual method applied in the cutting-plane scheme
A practical warm-start procedure is described for the infeasible primal-dualinterior-point method employed to solve the restricted master problem within the cutting-plane method. ...
Jacek Gondzio
CCGRID
2006
IEEE
13 years 10 months ago
Compilation of XSLT into Dataflow Graphs for Web Service Composition
Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and ...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...