Sciweavers

4539 search results - page 509 / 908
» Approaches to Compute Workflow Complexity
Sort
View
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 6 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
COR
2008
111views more  COR 2008»
15 years 6 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
DSP
2006
15 years 6 months ago
Matrix pencil method for simultaneously estimating azimuth and elevation angles of arrival along with the frequency of the incom
In this paper we describe a method for simultaneously estimating the direction of arrival (DOA) of the signal along with its unknown frequency. In a typical DOA estimation problem...
Nuri Yilmazer, Raul Fernandez-Recio, Tapan K. Sark...
FUIN
2006
128views more  FUIN 2006»
15 years 6 months ago
A Rewriting Framework for Rule-Based Programming Dynamic Applications
In recent years light-weighted formal methods are of growing interest in construction and analysis of complex concurrent software system. A new rule-action based term rewriting fr...
Anatoly E. Doroshenko, Ruslan Shevchenko
CVGIP
2007
88views more  CVGIP 2007»
15 years 6 months ago
Autonomous pedestrians
We address the difficult open problem of emulating the rich complexity of real pedestrians in urban environments. Our artificial life approach integrates motor, perceptual, beha...
Wei Shao, Demetri Terzopoulos