Sciweavers

389 search results - page 25 / 78
» Some natural decision problems in automatic graphs
Sort
View
KI
2005
Springer
14 years 27 days ago
Temporalizing Spatial Calculi: On Generalized Neighborhood Graphs
To reason about geographical objects, it is not only necessary to have more or less complete information about where these objects are located in space, but also how they can chang...
Marco Ragni, Stefan Wölfl
JASSS
1998
82views more  JASSS 1998»
13 years 7 months ago
Qualitative modeling and simulation of socio-economic phenomena
This paper describes an application of recently developed qualitative reasoning techniques to complex, socio{economic allocation problems. We explain why we believe traditional op...
Giorgio Brajnik, Marji Lines
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
11 years 9 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
COCOA
2008
Springer
13 years 9 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
FLAIRS
2010
13 years 9 months ago
Handling of Numeric Ranges for Graph-Based Knowledge Discovery
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
Oscar E. Romero, Jesus A. Gonzalez, Lawrence B. Ho...