Sciweavers

14518 search results - page 182 / 2904
» Two Problems for Sophistication
Sort
View
DESRIST
2010
Springer
152views Education» more  DESRIST 2010»
14 years 23 days ago
Process Performance Management - Identifying Stereotype Problem Situations as a Basis for Effective and Efficient Design Researc
Abstract. Just recently many organisations get involved with process performance management (PPM). It appears, however, that PPM initiatives confront organisations with multi-facet...
Anne Cleven, Felix Wortmann, Robert Winter
APIN
2006
207views more  APIN 2006»
13 years 10 months ago
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and instances with 100 cus...
Beatrice M. Ombuki, Brian Ross, Franklin Hanshar
IJFCS
2008
166views more  IJFCS 2008»
13 years 10 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
15 years 23 days 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
MFCS
2005
Springer
14 years 4 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