Sciweavers

2584 search results - page 199 / 517
» On the Forward Checking Algorithm
Sort
View
86
Voted
AAAI
2008
15 years 17 days ago
Reasoning with Cardinal Directions: An Efficient Algorithm
Direction relations between extended spatial objects are important commonsense knowledge. Recently, Goyal and Egenhofer proposed a formal model, called Cardinal Direction Calculus...
Xiaotong Zhang, Weiming Liu, Sanjiang Li, Mingshen...
FAC
2008
100views more  FAC 2008»
14 years 10 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
87
Voted
DGCI
2005
Springer
15 years 3 months ago
Algorithms for the Topological Watershed
The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,9] consists in modifying the original image by lowering...
Michel Couprie, Laurent Najman, Gilles Bertrand
92
Voted
ICGA
1997
134views Optimization» more  ICGA 1997»
14 years 11 months ago
Local Search Genetic Algorithm for Optimization of Highly Reliable Communications Networks
This paper presents a genetic algorithm (GA) with specialized encoding, initialization and local search genetic operators to optimize communication network topologies. This NPhard...
Berna Dengiz, Fulya Altiparmak, Alice E. Smith
77
Voted
DAM
2000
97views more  DAM 2000»
14 years 10 months ago
Algorithms and obstructions for linear-width and related search parameters
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
Dimitrios M. Thilikos