Sciweavers

8413 search results - page 197 / 1683
» Ordering Problem Subgoals
Sort
View
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 4 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
MCS
2004
Springer
14 years 4 months ago
An Empirical Comparison of Hierarchical vs. Two-Level Approaches to Multiclass Problems
The ECOC framework provides a powerful and popular method for solving multiclass problems using a multitude of binary classifiers. We had recently introduced the Binary Hierarchica...
Suju Rajan, Joydeep Ghosh
ECCV
2010
Springer
14 years 4 months ago
Convex Relaxation for Multilabel Problems with Product Label Spaces
Convex relaxations for continuous multilabel problems have attracted a lot of interest recently [1–5]. Unfortunately, in previous methods, the runtime and memory requirements sca...
HICSS
1994
IEEE
149views Biometrics» more  HICSS 1994»
14 years 2 months ago
Stochastic Problem Solving by Local Computation Based on Self-Organization Paradigm
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
Yasusi Kanada, Masao Hirokawa
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
14 years 6 days ago
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg