Sciweavers

2266 search results - page 210 / 454
» Some Solutions to the Ignoring Problem
Sort
View
WEA
2007
Springer
112views Algorithms» more  WEA 2007»
16 years 22 days ago
Crossing Minimization in Weighted Bipartite Graphs
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
Olca A. Çakiroglu, Cesim Erten, Ömer K...
ANTSW
2004
Springer
16 years 17 hour ago
S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
Walter J. Gutjahr
CIS
2006
Springer
15 years 10 months ago
A New Multi-objective Evolutionary Optimisation Algorithm: The Two-Archive Algorithm
Many Multi-Objective Evolutionary Algorithms (MOEAs) have been proposed in recent years. However, almost all MOEAs have been evaluated on problems with two to four objectives only...
Kata Praditwong, Xin Yao
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
15 years 1 months ago
Q-learning and enhanced policy iteration in discounted dynamic programming
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
Dimitri P. Bertsekas, Huizhen Yu
CVPR
2011
IEEE
14 years 10 months ago
Supervised Hypergraph Labeling
We address the problem of labeling individual datapoints given some knowledge about (small) subsets or groups of them. The knowledge we have for a group is the likelihood value fo...
Toufiq Parag, Ahmed Elgammal