Sciweavers

5128 search results - page 80 / 1026
» When Abstraction Fails
Sort
View
SOCASE
2009
Springer
15 years 4 months ago
Business Modeling via Commitments
Abstract. Existing computer science approaches to business modeling offer lowstractions such as data and control flows, which fail to capture the business intent underlying the in...
Pankaj R. Telang, Munindar P. Singh
IROS
2008
IEEE
113views Robotics» more  IROS 2008»
15 years 4 months ago
Navigating dynamic environments using trajectory deformation
Abstract— Path deformation is a technique that was introduced to generate robot motion wherein a path, that has been computed beforehand, is continuously deformed on-line in resp...
Vivien Delsart, Thierry Fraichard
SSDBM
2008
IEEE
114views Database» more  SSDBM 2008»
15 years 4 months ago
A General Framework for Increasing the Robustness of PCA-Based Correlation Clustering Algorithms
Abstract. Most correlation clustering algorithms rely on principal component analysis (PCA) as a correlation analysis tool. The correlation of each cluster is learned by applying P...
Hans-Peter Kriegel, Peer Kröger, Erich Schube...
LCN
2007
IEEE
15 years 4 months ago
Detecting Black Hole Attacks in Tactical MANETs using Topology Graphs
Abstract— Black Hole Attacks are a serious threat to communication in tactical MANETs. In this work we present TOGBAD a new centralised approach, using topology graphs to identif...
Elmar Gerhards-Padilla, Nils Aschenbruck, Peter Ma...
EVOW
2007
Springer
15 years 4 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz