Sciweavers

8647 search results - page 32 / 1730
» The Container Selection Problem
Sort
View
CORR
2007
Springer
86views Education» more  CORR 2007»
14 years 9 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert
ICMLC
2010
Springer
14 years 8 months ago
An integrity-based fuzzy c-means method resolving cluster size sensitivity problem
: Cluster size insensitive FCM (csiFCM) dynamically adjusts the membership value of each object based on the size of the cluster to which it is assigned after defuzzification to re...
Y. H. Lai, P. W. Huang, P. L. Lin
80
Voted
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 2 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
92
Voted
EMO
2003
Springer
162views Optimization» more  EMO 2003»
15 years 2 months ago
PISA: A Platform and Programming Language Independent Interface for Search Algorithms
This paper introduces an interface specification (PISA) that allows to separate the problem-specific part of an optimizer from the problem-independent part. We propose a view of ...
Stefan Bleuler, Marco Laumanns, Lothar Thiele, Eck...
IDEAS
2005
IEEE
113views Database» more  IDEAS 2005»
15 years 3 months ago
On the Intersection of XPath Expressions
— XPath is a common language for selecting nodes in an XML document. XPath uses so called path expressions which describe a navigation path through semistructured data. In the la...
Beda Christoph Hammerschmidt, Martin Kempa, Volker...