Sciweavers

14739 search results - page 337 / 2948
» An optimization problem on the sphere
Sort
View
251
Voted
FAW
2010
Springer
259views Algorithms» more  FAW 2010»
15 years 22 days ago
Adaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
Hee-Kap Ahn, Yoshio Okamoto
JAIR
2007
141views more  JAIR 2007»
14 years 11 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
AAAI
2000
15 years 1 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
87
Voted
GECCO
2008
Springer
153views Optimization» more  GECCO 2008»
15 years 21 days ago
G-Metric: an M-ary quality indicator for the evaluation of non-dominated sets
An open problem in multiobjective optimization using the Pareto optimality criteria, is how to evaluate the performance of different evolutionary algorithms that solve multi– o...
Giovanni Lizárraga Lizárraga, Arturo...
CDC
2010
IEEE
160views Control Systems» more  CDC 2010»
14 years 6 months ago
Aggregation-based model reduction of a Hidden Markov Model
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...
Kun Deng, Prashant G. Mehta, Sean P. Meyn