Sciweavers

4539 search results - page 269 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ATAL
2006
Springer
15 years 10 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
ICCSA
2003
Springer
15 years 11 months ago
Urban Site Modeling from LiDAR
This paper presents a complete modeling system that extracts complex building structures with irregular shapes and surfaces. Our modeling approach is based on the use of airborne L...
Suya You, Jinhui Hu, Ulrich Neumann, Pamela Fox
ISORC
1998
IEEE
15 years 10 months ago
Compositional Specification and Structured Verification of Hybrid Systems in cTLA
Many modern chemical plants have to be modelled as complex hybrid systems consisting of various continuous and event-discrete components. Besides of the modular and easy-to-read s...
Peter Herrmann, Günter Graw, Heiko Krumm
JMM2
2007
96views more  JMM2 2007»
15 years 6 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram
CONCUR
2007
Springer
16 years 23 days ago
A Marriage of Rely/Guarantee and Separation Logic
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
Viktor Vafeiadis, Matthew J. Parkinson