Sciweavers

314 search results - page 21 / 63
» connection 1998
Sort
View
PPSN
1998
Springer
14 years 2 months ago
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
A. E. Eiben, Jano I. van Hemert, Elena Marchiori, ...
RELMICS
1998
Springer
14 years 1 months ago
Coping with semilattices of relations in logics with relative accessibility relations
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
Stéphane Demri
MVA
1998
230views Computer Vision» more  MVA 1998»
13 years 11 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
WSC
1998
13 years 11 months ago
Simulation of a Large-Scale Brewery Distribution System
This paper describes a simulation model of a large beverage distribution center. The brewery distribution center has a volume of 71,600 cubic meters and contains about 8,000 palle...
K. Heinz Weigl
ARSCOM
1998
79views more  ARSCOM 1998»
13 years 9 months ago
A characterization of halved cubes
The vertex set of a halved cube Qd consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then i...
Wilfried Imrich, Sandi Klavzar, Aleksander Vesel