Sciweavers

6740 search results - page 250 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
CCCG
1993
15 years 2 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
88
Voted
SOFSEM
2004
Springer
15 years 6 months ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...
104
Voted
STRINGOLOGY
2004
15 years 2 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
83
Voted
INTERACT
2003
15 years 2 months ago
Classification of Usability Problems (CUP) Scheme
: Defect classification can improve product quality and motivate process improvement. Several defect classification schemes have been developed and used with good results in softwa...
Ebba Thora Hvannberg, Effie Lai-Chong Law
105
Voted
EOR
2008
97views more  EOR 2008»
15 years 25 days ago
Optimization models for the single delay management problem in public transportation
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
Géraldine Heilporn, Luigi De Giovanni, Mart...