Sciweavers

8671 search results - page 414 / 1735
» A generator for hierarchical problems
Sort
View
MP
2002
143views more  MP 2002»
15 years 6 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
PRICAI
2004
Springer
16 years 7 days ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
CORR
2000
Springer
149views Education» more  CORR 2000»
15 years 6 months ago
On The Closest String and Substring Problems
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
Ming Li, Bin Ma, Lusheng Wang
CHI
2005
ACM
16 years 7 months ago
Comparing usability problems and redesign proposals as input to practical systems development
Usability problems predicted by evaluation techniques are useful input to systems development; it is uncertain whether redesign proposals aimed at alleviating those problems are l...
Erik Frøkjær, Kasper Hornbæk
ACCV
2007
Springer
15 years 8 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks