Sciweavers

4266 search results - page 102 / 854
» The container loading problem
Sort
View
AAAI
2004
15 years 3 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
MOR
2010
111views more  MOR 2010»
15 years 25 days ago
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...
ICTAI
2009
IEEE
15 years 4 days ago
A Confidence-Based Dominance Operator in Evolutionary Algorithms for Noisy Multiobjective Optimization Problems
This paper describes a noise-aware dominance operator for evolutionary algorithms to solve the multiobjective optimization problems (MOPs) that contain noise in their objective fu...
Pruet Boonma, Junichi Suzuki
CDC
2008
IEEE
114views Control Systems» more  CDC 2008»
15 years 9 months ago
Dynamic Traveling Repairperson Problem for dynamic systems
— In this paper, we study the Dynamic Traveling Repairman Problem (DTRP) for dynamic systems. In the DTRP, customers are arising dynamically and randomly in a bounded region R, a...
Sleiman Itani, Emilio Frazzoli, Munther A. Dahleh
CPM
2004
Springer
120views Combinatorics» more  CPM 2004»
15 years 7 months ago
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...