Sciweavers

13987 search results - page 162 / 2798
» The Two Guards Problem
Sort
View
145
Voted
IJFCS
2008
166views more  IJFCS 2008»
15 years 3 months ago
Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems
The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event s...
Hsu-Chun Yen
CVPR
2003
IEEE
16 years 5 months ago
An Efficient Solution to the Five-Point Relative Pose Problem
An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between ...
David Nistér
105
Voted
MFCS
2005
Springer
15 years 9 months ago
Explicit Inapproximability Bounds for the Shortest Superstring Problem
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
Virginia Vassilevska
125
Voted
EVOW
2004
Springer
15 years 9 months ago
Binary Merge Model Representation of the Graph Colouring Problem
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
István Juhos, Attila Tóth, Jano I. v...
112
Voted
EVOW
2003
Springer
15 years 8 months ago
A Genetic Algorithm for the Index Selection Problem
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NP-hard and known in the literature as...
Jozef Kratica, Ivana Ljubic, Dusan Tosic