Sciweavers

1232 search results - page 244 / 247
» Digraphs: theory, algorithms and applications
Sort
View
MANSCI
2007
90views more  MANSCI 2007»
13 years 7 months ago
Selecting a Selection Procedure
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...
Jürgen Branke, Stephen E. Chick, Christian Sc...
CCR
2000
96views more  CCR 2000»
13 years 7 months ago
Decentralized optimal traffic engineering in the internet
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
Constantino M. Lagoa, Hao Che
MOC
2000
70views more  MOC 2000»
13 years 7 months ago
Extrapolation methods and derivatives of limits of sequences
Let {Sm} be an infinite sequence whose limit or antilimit S can be approximated very efficiently by applying a suitable extrapolation method E0 to {Sm}. Assume that the Sm and henc...
Avram Sidi
IJCV
1998
238views more  IJCV 1998»
13 years 7 months ago
Feature Detection with Automatic Scale Selection
The fact that objects in the world appear in different ways depending on the scale of observation has important implications if one aims at describing them. It shows that the not...
Tony Lindeberg
ENTCS
2008
153views more  ENTCS 2008»
13 years 7 months ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas