Sciweavers

769 search results - page 143 / 154
» Reducing the cognitive complexity of business process models
Sort
View
IMR
2004
Springer
14 years 22 days ago
Entkerner: A System for Removal of Globally Invisible Triangles from Large Meshes
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
Manfred Ernst, Frank Firsching, Roberto Grosso
ICRA
2003
IEEE
158views Robotics» more  ICRA 2003»
14 years 19 days ago
Probabilistic cooperative localization and mapping in practice
In this paper we present a probabilistic framework for the reduction in the uncertainty of a moving robot pose during exploration by using a second robot to assist. A Monte Carlo ...
Ioannis M. Rekleitis, Gregory Dudek, Evangelos E. ...
IPPS
2002
IEEE
14 years 8 days ago
Optimal Remapping in Dynamic Bulk Synchronous Computations via a Stochastic Control Approach
A bulk synchronous computation proceeds in phases that are separated by barrier synchronization. For dynamic bulk synchronous computations that exhibit varying phase-wise computat...
Gang George Yin, Cheng-Zhong Xu, Le Yi Wang
ICSE
2001
IEEE-ACM
13 years 11 months ago
Effective Software Architecture Design: From Global Analysis to UML Descriptions
It is now generally accepted that separating software architecture into multiple views can help in reducing complexity and in making sound decisions about design trade-offs. Our f...
Robert L. Nord, Daniel J. Paulish, Dilip Soni, Chr...
GPCE
2007
Springer
13 years 11 months ago
Generative metaprogramming
Recent advances in Software Engineering have reduced the cost of coding programs at the expense of increasing the complexity of program synthesis, i.e. metaprograms, which when ex...
Salvador Trujillo, Maider Azanza, Oscar Día...